• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于距离在非网格点集上生成用于光学抛光的单一路径随机路径。

Distance-based generation of a unicursal random path on a non-grid point set for optical polishing.

作者信息

Feng Yunpeng, Cheng Haobo, Zhang Shaohua

出版信息

Appl Opt. 2023 Sep 20;62(27):7288-7298. doi: 10.1364/AO.497402.

DOI:10.1364/AO.497402
PMID:37855586
Abstract

In modern ultra-precision polishing, sub-aperture technologies are prone to mid-spatial frequency errors due to identical patterns of a path. A random tool path on a regular point set is widely used to suppress mid-spatial frequency errors. In this study, two non-grid uniform point sets, the Fibonacci and the three-directional, were introduced into optical polishing. To solve the time-consuming problem caused by a large amount of distance calculation, a distance-based weighted random (DBWR) algorithm and a linear programming and connecting (LPC) algorithm were presented. The DBWR algorithm reduces the generation time by strengthening the weight of the neighboring points in a specific direction, while the LPC algorithm adjusts the order and distance of points artificially. Then a random stitching method was proposed for the large-scale point set applying to large-sized optical surfaces, which dramatically reduced the generation time. Finally, experiments validated that the algorithms for non-grid sets can be effectively used for optical surface figuring without introducing an apparent mid-spatial frequency.

摘要

在现代超精密抛光中,由于路径模式相同,子孔径技术容易产生中空间频率误差。规则点集上的随机刀具路径被广泛用于抑制中空间频率误差。在本研究中,将两种非网格均匀点集,即斐波那契点集和三向点集,引入到光学抛光中。为了解决大量距离计算导致的耗时问题,提出了基于距离的加权随机(DBWR)算法和线性规划与连接(LPC)算法。DBWR算法通过增强特定方向上相邻点的权重来减少生成时间,而LPC算法则人工调整点的顺序和距离。然后针对适用于大型光学表面的大规模点集提出了一种随机拼接方法,该方法显著减少了生成时间。最后,实验验证了非网格集算法可有效用于光学表面整形,且不会引入明显的中空间频率。

相似文献

1
Distance-based generation of a unicursal random path on a non-grid point set for optical polishing.基于距离在非网格点集上生成用于光学抛光的单一路径随机路径。
Appl Opt. 2023 Sep 20;62(27):7288-7298. doi: 10.1364/AO.497402.
2
Six-directional pseudorandom consecutive unicursal polishing path for suppressing mid-spatial frequency error and realizing consecutive uniform coverage.
Appl Opt. 2019 Nov 1;58(31):8529-8541. doi: 10.1364/AO.58.008529.
3
Reduction of mid-spatial frequency errors on aspheric and freeform optics by circular-random path polishing.通过圆形随机路径抛光减少非球面和自由曲面光学元件的中频空间频率误差。
Opt Express. 2021 Sep 13;29(19):29802-29812. doi: 10.1364/OE.435945.
4
Research on the Influence of the Material Removal Profile of a Spherical Polishing Tool on the Mid-Spatial Frequency Errors of Optical Surfaces.球形抛光工具材料去除轮廓对光学表面中空间频率误差的影响研究
Micromachines (Basel). 2024 May 15;15(5):654. doi: 10.3390/mi15050654.
5
Unicursal random maze tool path for computer-controlled optical surfacing.
Appl Opt. 2015 Dec 1;54(34):10128-36. doi: 10.1364/AO.54.010128.
6
Pseudo-random tool paths for CNC sub-aperture polishing and other applications.用于数控子孔径抛光及其他应用的伪随机刀具路径。
Opt Express. 2008 Nov 10;16(23):18942-9. doi: 10.1364/oe.16.018942.
7
Suppression of mid-spatial-frequency waviness by a universal random tree-shaped path in robotic bonnet polishing.
Opt Express. 2022 Aug 1;30(16):29216-29233. doi: 10.1364/OE.468103.
8
Modeling and analysis of the mid-spatial- frequency error characteristics and generation mechanism in sub-aperture optical polishing.子孔径光学抛光中空间中频误差特性及产生机理的建模与分析
Opt Express. 2020 Mar 16;28(6):8959-8973. doi: 10.1364/OE.388848.
9
Restraint of path effect on optical surface in magnetorheological jet polishing.磁流变喷射抛光中光学表面路径效应的抑制
Appl Opt. 2016 Feb 1;55(4):935-42. doi: 10.1364/AO.55.000935.
10
An efficient dynamic system for real-time robot-path planning.一种用于实时机器人路径规划的高效动态系统。
IEEE Trans Syst Man Cybern B Cybern. 2006 Aug;36(4):755-66. doi: 10.1109/tsmcb.2005.862724.