Abstract
This paper proposed an optimized algorithm for discretization of cutter location points on the laser cutting path of three-dimensional surface. The initial discretization step size was calculated due to the curvature of the curve on the starting point and accuracy requirements. A reference sphere was established by taking the initial discretization step size as the radius. The initial cutter location point was located on the intersection of the reference sphere and the processing path. The radius of reference sphere was dynamically adjusted by dichotomy according to string height difference in order to get the optimal cutter location on the path to be processed. This algorithm has a high computational efficiency. And an automatic programming software used for three-dimensional laser cutting was developed based on this algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
