An optimized algorithm for discretization of cutter location points on the laser cutting path of three-dimensional surface
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.
Space curve Laser cutting Cutter location point Discretization
Hu Jun Deng Fan Qiu Xianchen
School of Mechanical Engineering,Shanghai Jiaotong Univ.,Shanghai 200240,China
国际会议
the 3nd International Conference on Digital Manufacturing & Automation (第三届数字制造与自动化国际会议(ICDMA 2012))
桂林
英文
19-22
2012-08-01(万方平台首次上网日期,不代表论文的发表时间)