刺绣复杂区域填充的简化算法  

Simplified algorithm of embroidery complex region filling

作　　者：吴东庆[1] 刘就女[2] 丁川[2] 李哲林[2] 

机构地区：[1]仲恺农业技术学院计算科学系,广东广州510225 [2]华南理工大学工业设计及图学研究所,广东广州510640

出　　处：《计算机工程与设计》2006年第7期1269-1271,1307,共4页Computer Engineering and Design

摘　　要：复杂区域填充问题是刺绣CAD算法设计中的难点。国内多位学者提出的算法主要在点一级粒度的数据结构进行描述,在一定程度上把问题复杂化了。从面向对象的思想出发,充分结合问题的特殊性,采用图元级粒度的数据结构对问题进行分析,简化了算法。该算法运用于某工业刺绣CAD软件的开发,取得良好效果。The problem of complex region filling is an obstacle for embroidery CAD＇s algorithm design. The provided solutions by some domestic researchers are described mostly based on point granularity, which complicate the problem to some extent. From the view of object-oriented idea and integrating the particularity of problem, the algorithm with the help of graphic meta data structure is analyzed and simplified. The algorithm works well for an industry embroidery CAD system.

关 键 词：计算机应用 算法 复杂区域 填充问题 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]