摘要
DXF(Drawing Exchange File)文件的图形元素通常是无序排列的,其图元数据在激光加工过程中无效行程多、效率低下。以DXF文件中记录的图形元素为对象,用面域作图技术将零散的加工图形尽可能编组为连续的封闭图组,从原点开始贪婪地选择到下一个图组起始点的最短路径,直至得到整个图纸的优化路径。算法时间复杂性为O(n2)。实验证明该算法应用到激光雕切加工中能减少光头的空走行程和开关光次数,提高加工效率。
A DXF file is normally occupied by many disorder graphic elements,which cause numerous vain journeys yet low efficiency in laser machining.With the graphic elements of DXF file as the object,region drawing technology is used to convert those scattered graphics into a list of closed graphic groups.Starting from the origin,the shortest path from current position to the start of next graphic groups is obtained greedily until the optimized path of the whole drawing is achieved.Time complexity of the algorithm is O（n2）.The experimental results prove that the proposed algorithm applied to laser curving and cutting can reduce the vacant path and the numbers of turning on or off the laser,and thus improve the efficiency of machining.
出处
《工程图学学报》
CSCD
北大核心
2010年第6期106-110,共5页
Journal of Engineering Graphics
关键词
计算机应用
路径优化
旅行商问题
面域
computer application
path optimization
traveling salesman problem
region
