激光技术2011，Vol.35Issue(3)：372-375,397,5.DOI:10.3969/j.issn.1001-3806.2011.03.022
用于位图激光打标的数字曲线多边形逼近算法
Polygonal approximating algorithm of digital curves for bitmap laser marking
罗彭 1吴云峰 1岳松 1袁爱龙 1成志强2
作者信息
- 1. 电子科技大学光电信息学院,成都,610054
- 2. 成都英特罗克科技有限公司,成都,610051
- 折叠
摘要
Abstract
A bitmap laser marking method based on bitmap vectorization was developed to overcome the difficulties of traditional bitmap marking method used in a laser marking system. In this method, the edge or skeleton of the bitmap was extracted in the form of digital curves firstly, then the polygonal approximating method was adopted to vectorize above digital curves, finally the vectorized data was engraved by means of continuous marking method. The involved algorithm of polygonal approximation of digital curves, consisting of Freeman chain code generating, approximate digital straight line segments extracting and polygonal approximating, was emphatically discussed. The experimental results show that the approximating algorithm works well. The practical application shows that the precision and the speed of bitmap marking can be largely improved with this marking method.关键词
激光技术/位图矢量化/数字曲线/多边形逼近/Freeman链码Key words
laser technique/ bitmap vectorization/ digital curves/ polygonal approximation/ Freeman chain code分类
矿业与冶金引用本文复制引用
罗彭,吴云峰,岳松,袁爱龙,成志强..用于位图激光打标的数字曲线多边形逼近算法[J].激光技术,2011,35(3):372-375,397,5.
