Research On Algorithm Of Scanning Path Generation In Laser Marking

In the 20th century,laser marking as a laser processing technology began to develop,through the laser beam ablation on the surface of the metal,glass,plastic and other material,it can get a variety of colors and graphics.Compared with traditional printing technology,laser marking as a new printing technology has obvious advantages,its marked pattern with no fading,pollution-free,beautiful quality,low cost,has been widely used in ceramics,clothing,medical equipment and equipment,electronic products and food fields.Laser marking quality is determined by the laser marking hardware equipment and laser marking software.The main function of the laser marking software is to generate the marking path and complete the marking control of the laser equipment.The core algorithm in the laser marking software is the path generation algorithm,including the path filling algorithm which is used to generate the fill path and the path optimization algorithm which is used to optimize the graphics jump path.The performance of path generation algorithm is decided by the efficiency indicators:the calculate time of algorithm,the distance of path jump and cost indicators:the number of fill graphics.The existing path filling algorithm mainly adopts the line scanning and ring scanning algorithm.The efficient of line scanning algorithm is high,but the cost of marking is dear and the quality of printing is flawed.The ring scanning algorithm can avoid the defects of the line scanning algorithm,is the mainstream direction of the research.But it is not efficient in compute,is poor in arc processing,and the number of generate graphics is not the lowest.The existing path optimization algorithm mainly adopts various heuristic algorithms,the optimization effect of these algorithms is ideal,but they are relatively inefficient which seriously affects the practicability of these algorithms.According to this situation,In this paper,we have improved the algorithm of path filling algorithm and path optimization based on the existing algorithms,put forward the path filling algorithm based on computer graphics and the path optimization algorithm based on partition.The improved path filling algorithm first identify the fill area for complex graphics,and then fill the outer contour globally,decompose intersecting the graphics when the them encounter,finally fill the graphics after the decomposition.The improved path optimization algorithm first divides all the graphs into several regions according to the distribution position,then uses the genetic algorithm to optimize the graphics in the regions and the regional connection,finally obtains the optimized path.The experimental results show that the improved path optimization algorithm can greatly reduce the number of graphics generation and improve the effect of marking.Compared with the original algorithm,the overall performance of the algorithm can improve about 20%.In the case of the improved path optimization algorithm can limited the search range of the algorithm by using the partition strategy,it can improve more than 90%in the efficiency of the algorithm,the optimization effect can also be improved about 5%.