首页 | 官方网站   微博 | 高级检索  
     

激光标刻的复杂区域填充算法
引用本文:秦应雄,唐霞辉,钟如涛,郑启光.激光标刻的复杂区域填充算法[J].华中科技大学学报(自然科学版),2006,34(8):59-61.
作者姓名:秦应雄  唐霞辉  钟如涛  郑启光
作者单位:华中科技大学,光电子科学与工程学院,湖北,武汉,430074
摘    要:为减少填充线段和提高激光加工效率,对复杂区域的填充算法进行了研究.采用延长某些岛屿边界将包含岛屿的区域变为单连通域;然后用最长边延长法和最长边平行截取法将单连通域分解为简单凸多边形,简单凸多边形填充方法是先找到凸多边形所有边对应的高最小的那条边,平行该边进行填充,最后对填充线段的连接顺序进行优化处理.与传统的固定方向扫描填充相比,采用本算法可使复杂区域和实心文字的激光标刻效率提高20%~40%.

关 键 词:激光标刻  连通区域  填充算法
文章编号:1671-4512(2006)08-0059-01
收稿时间:2005-07-30
修稿时间:2005年7月30日

Filling algorithm for laser-marked complex region
Qin Yingxiong,Tang Xiahui,Zhong Rutao,Zheng Qiguang.Filling algorithm for laser-marked complex region[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2006,34(8):59-61.
Authors:Qin Yingxiong  Tang Xiahui  Zhong Rutao  Zheng Qiguang
Abstract:Filling algorithm for complex regions is studied to reduce the number of filling lines and improve the efficiency of laser processing. The boundaries of some islands are prolonged to turn the regions the islands into single-connectivity regions, and these are divided into simple convex polygons by the prolonged longest boundary line and by parallel cutting with the longest lines at adjacent point. Simple convex polygons are filled with the lines parallel to the boundary line whose height is the smallest. The order of filling lines is optimized in laser marking. The efficiency of laser marking is improved by 20 %-40 % with the new filling algorithm.
Keywords:laser marking  connectivity region  filling algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号