任意多边形填充新算法  

New Method of Filling Arbitrary Polygon

作　　者：王培珍[1] 许睿[1] 

机构地区：[1]安徽工业大学电气信息学院,安徽马鞍山243002

出　　处：《安徽工业大学学报（自然科学版）》2009年第4期405-408,共4页Journal of Anhui University of Technology（Natural Science）

摘　　要：提出一种扫描线与种子填充相融合的多边形填充算法。利用扫描线快速地标记多边形外围部分区域,通过扫描线上的末端点和多边形边缘点寻找种子点,将剩余部分标记,对未被标记的区域进行填充。实验结果表明,该方法虽然采用了多种不同的标记方式,但计算的冗余度小且不会产生误差,适用于任意多边形的填充。A method of filling arbitrary polygon which is based on scan line and seed filling is proposed. In this method, the outside area of polygon is fastly marked by the scan line points, and the remnants of outside area are marked by the seed points which come from the scan line and edge points on polygon, the areas inside the polygon with no mark are filled. Experimental result shows that the computational redundancy is reduced and the filling accuracy is improved even though different methods of marking outside area are used. The method can be used to fill arbitrary polygon.

关 键 词：多边形 冗余度 种子填充 标记 扫描线 

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