Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
