Abstract: 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.

Key words: computer application, path optimization, traveling salesman problem, region