Laser Marking Hatch Contour Generation Algorithm
Article No.: 16, Pages 1 - 4
Abstract
In order to calculate the laser filling path of the irregular simply connected figure, we establish the parallel filling path model and contour filling path model. According to the classification of the concave and convex points, the total path of the laser filling line is calculated by dividing the polygon. For the multi-connected laser-filled images, an optimized multi-connected contour filling model is established, and the laser path is calculated according to the new polygon segmentation method. Through the model test, the path length required by the parallel filling model to fill the simply connected graph and the multi-connected graph is 9697.1m and 8762.8m respectively, and the required time is 29.1s and 30.2s respectively. The path lengths needed to fill simply connected graphs and multi-connected graphs by contour filling model are 10005.1m and 8210.3m respectively, and the required time is 65.8s and 49.7s respectively
References
[1]
Wang Yixiang. Research on Algorithm of Scanning Path Generation in laser marking [D]. Wuhan University,2017.
[2]
Yi Xiong, Sang-In Park, Suhasini Padmanathan, Process planning for adaptive contour parallel toolpath in additive manufacturing with variable bead width. 2019, 105(5-8):4159-4170.
[3]
GUO Yan-yan, GUO Qi. A Sort of Gray-scale Morphological Dilations and Erosions [J]. Department of Mathematics, Suzhou University of Science and Technology, Suzhou 215009, China, 2017,32(02):181-186
[4]
YANG De-cheng, LI Feng-qi, WANG Yi, WANG Sheng-fa and YIN Hui-shu. Intelligent 3D Printing Path Planning Algorithm [J]. Computer Science, 2020, 47(08): 267-271
[5]
Huang Lei. Research on Algorithms of Polygon Region Filling and Information Extraction in Graphic Image. Journal of Chongqing Institute of Science and Technology. 2020.12
[6]
Qiu Guoqing. Cyclic Scanline Seed Filling Algorithm for Polygonal Graphics. Journal of Huaibei Normal University (Natural Science). 2017.5
[7]
Hou Liang, Li Chenggui. Graph filling and character display in aircraft integrated display system. Fire Control& Command Control. 2009.
[8]
Wu Y, Liu Y, Ahmed S H, Dominant data set selection algorithms for electricity consumption time-series data analysis based on affine transformation[J]. IEEE Internet of Things Journal, 2019, 7(5): 4347-4360.
[9]
Liu Y, James J Q, Kang J, Privacy-preserving traffic flow prediction: A federated learning approach[J]. IEEE Internet of Things Journal, 2020, 7(8): 7751-7763.
[10]
Liu Y, Yuan X, Xiong Z, Federated learning for 6g communications: Challenges, methods, and future directions[J]. China Communications, 2020, 17(9): 105-118.
Recommendations
Laser Marking Hatch Contour Generation
ICCIR '21: Proceedings of the 2021 1st International Conference on Control and Intelligent RoboticsLaser marking has been widely used in industrial processing. For different hatching methods, the operating efficiency and the clarity of the marking pattern are also different. Herein, we realize the zigzag parallel and contour parallel hatch of the ...
On the contour of graphs
Let G=(V,E) be a finite, simple and connected graph. Let S@?V, its closed interval I[S] is the set of all vertices lying on a shortest path between any pair of vertices of S. The set S is geodetic if I[S]=V. The eccentricity of a vertex v is the number ...
Automatic Contour Generation of 4D CT by Deformable Registration
PACIIA '08: Proceedings of the 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application - Volume 02The purpose of this work is to develop a method of automatic contour generation by deformable registration on four-dimensional CT data. Firstly, a region of interest was manually delineated by a physician on a reference phase. Then deformable ...
Comments
Information & Contributors
Information
Published In
May 2021
2053 pages
ISBN:9781450390200
DOI:10.1145/3469213
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 18 August 2021
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICAIIS 2021
ICAIIS 2021: 2021 2nd International Conference on Artificial Intelligence and Information Systems
May 28 - 30, 2021
Chongqing, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 50Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format