Filling Algorithm of Polygons and Embedded Polygons

Abstract

In this paper, by studying the laser marking trajectory model, for the two different marking modes of zigzag parallel and contour parallel, with or without contour nesting, different laser marking path generation algorithms are designed. And compare the time-consuming of the two algorithms, discuss and propose methods to optimize the algorithm to improve the efficiency of the algorithm to meet the needs of industrial applications. According to the requirements of the distance between the retracted boundary and the hatch line, the zigzag parallel trajectory generation algorithm and the contour parallel trajectory generation algorithm are designed, and the hatching curve is generated according to the given contour point set. Based on the algorithm above, in the face of contour nesting, the algorithm is improved, and the hatching curve is generated according to the given contour point set. For the zigzag parallel trajectory generation algorithm, considering the intersection of the scan line and the inner contour. For contour parallel trajectories, this paper uses a vertex-based offset algorithm, which takes a long time. This is because the vertex-based offset algorithm is more complicated to solve the problem of self-intersection. This paper proposes that for the zigzag parallel method, the angle of the workpiece can be adjusted to find the optimal angle, so that the marking path is the smallest. And for the contour parallel trajectory generation algorithm, this paper proposes an optimization too.