Abstract
In view of the disadvantages of existing planning methods used in CCOS techniques, such as low efficiency and workpieces containing obvious mid-frequency error after polishing, a new tool-path planning method based on improved Prim algorithm is presented. The core idea of method consists of the following steps: surface data reading, mesh generation, distribution of resident points determining, and polishing path generating. Then, comparison of raster path and the path based on improved Prim algorithm are carried out by simulations from aspects of path length and polishing texture. The results indicate that the path based on improved Prim algorithm can shorten path length as well as increase polishing efficiency; moreover, both the texture and mid-frequency errors can be improved by using the path presented. Finally, the processing experiments of raster path and the path presented are carried out. The experimental results show that the polishing efficiency and precision are improved by using the proposed method. Moreover, it can reduce the mid-frequency error of workpiece effectively. Thus, the experimental results which are in good agreement with the simulation results prove the feasibility of proposed method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Availability of data and material
The experimental and simulation date is transparent.
References
Hou J, Liu S-W, Wang H-X (2021) Research and application on the key techniques of conformal vibration polishing on optics. Optik 242: Article 166995
Ren L-J, Zhang G-P, Zhang L (2019) Modelling and investigation of material removal profile for computer controlled ultra-precision polishing. Precis Eng 55:144–153
Lin B, Jiang XM, Cao ZC, Huang T (2018) Development and theoretical analysis of novel center-inlet computer-controlled polishing process for high-efficiency polishing of optical surfaces. Precis Eng 52:276–290
Xue DL, Zhang ZY, Zhang XJ (2005) Computer controlled polishing technology for middle or small aspheric lens. Opt Precis Eng 13(2):198–204
Ni Y, Li J, Wang Y (2008) An efficient method of computer controlled polishing for small aspheric lens. Opt Tech 34(1):33–35+40
Mu G-Y, Fu X-H (2009) Computer controlled polishing for middle or small double-sided aspheric lens. J Appl Opt 30(5):818–822
Deng W-J, Zheng L-G, Shi Y-L (2008) Adaptive programming algorithm for generating polishing tool-path in computer controlled optical surfacing. Opt Precis Eng 17(1):65–71
Zhou L, Dai Y-F, Xie X-H (2009) A novel path used in computer-controlled polishing process based on uniform-area-increment spiral. J Nat Univ Def Technol 31(4):1–4
Zhao Q-Z, Zhang L, Han Y-J, Fan C (2019) Polishing path generation for physical uniform coverage of the aspheric surface based on the Archimedes spiral in bonnet polishing Show less. Proc IMechE Part B: J Eng Manuf 233(12):1–13
Zhang L, Han Y-J, Fan C, Tang Y, Song X-P (2017) Polishing path planning for physically uniform overlap of polishing ribbons on freeform surface. Int J Adv Manuf Technol 92(9–12):4525–4541
Han Y-J, Zhang L, Guo M, Fan C, Liang F-S (2018) Tool paths generation strategy for polishing of freeform surface with physically uniform coverage. Int J Adv Manuf Technol 95(5–8):2125–2144
Chen Y-X, Rong L-Y, Jun L-Q, Hui W-X, Feng Z (2019) Trochoidal toolpath for the pad-polishing of freeform surfaces with global control of material removal distribution. J Manuf Syst 51:1–16
Huang T, Zhao D, Cao Z-C (2020) Trajectory planning of optical polishing based on optimized implementation of dwell time. Precis Eng 62:223–231
Tama H, Cheng H-B (2010) An investigation of the effects of the tool path on the removal of material in polishing. J Mater Proc Technol 210:807–818
Mchael T, James H, Bill A (2002) Aspheric optics: smoothing the ripples with semi-flexible tools. Opt Eng 41(7):1473–1474
Gu M-Z, He L-F (2005) An investigation on polishing aspheric surface with middle aperture efficiently[J]. Opt Instrum 27(1):22:27
Li H-B, Chen J (2007) Dynamic optimum of minimum span tree’s algorithm devised by Prim. Comput Eng Appl 43(12):69–73
Jiang B, Zhang L (2009) Research on minimum spanning tree based on prim algorithm. Comput Eng Des 30(13):3244–3247
Wang Z-L, Liu M (2007) Proficient MATLAB. Beijing Publishing House of Electronics Industry
Acknowledgements
The authors would like to thank Laboratory of Robotics and Intelligent Systems (CASQuanzhou) for the experimental support. The authors would also like to acknowledge the editors and the anonymous referees for their insightful comments.
Funding
This work was funded by Laboratory of Robotics and Intelligent Systems (CASQuanzhou), Scientific and Technological Project of Quanzhou (No. 2020C071 and No. 2019C008R).
Author information
Authors and Affiliations
Contributions
Yinhui Xie: methodology, formal analysis, writing—original draft. Jinxing Yang: date curation, validation. Weilong Huang: experiment operation. Jun Li: writing—review and editing, resources.
Corresponding author
Ethics declarations
Ethical approval
This material is the author’s own original work, which has not been previously published elsewhere.
Consent to participate
Not applicable.
Consent for publication
The authors have read and agreed to publish the version of the manuscript.
Conflict of interest
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Xie, Y., Yang, J., Huang, W. et al. A tool-path planning method used in computer controlled optical surfacing based on improved prim algorithm. Int J Adv Manuf Technol 119, 5917–5927 (2022). https://doi.org/10.1007/s00170-022-08718-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-022-08718-y