Research on single-layer and non-nested contour generation algorithm in laser marking

Cross-sectional line calculation and scan path selection are the key control aspects in laser marking. This paper introduces two basic ways of hatching for non nested single-layer graphics in the process of laser marking, directional parallel hatch and contour parallel hatch. The former is based on the idea of scan line algorithm in computer graphics, and the latter eliminates the self intersection and heterogeneous intersection of hatch lines compared with the traditional contour parallel hatch generation algorithm. Based on these two algorithms, this paper establishes a mathematical model of contour parallel hatch and verifies the effectiveness and applicability of the algorithm through calculation examples. These works provide direction for optimizing the performance and efficiency of laser marking.