计算机工程与应用2012，Vol.48Issue(32)：170-175,6.DOI:10.3778/j.issn.1002-8331.1106-0110
一种等值线图的任意复杂多边形窗口裁剪算法
Algorithm for contour clipping against general polygon window
摘要
Abstract
This paper presents a new fast algorithm for contour clipping against general complex polygon windows. The new algorithm builds the bounding box of the clipping polygons and creates the grid structure. And the algorithm uses the grid structure to pre-clip the contours quickly. Through linked structure to clip the contours, it could get the final clipping result. This paper can realize the method of row scanning to judge the inside and outside attribute by building the linked structure and reduce the counts of segments intersection. Through many experiments, the new algorithm is proved to be very effective and stable. Additionally, the algorithm can resolve various special cases which contain complex nested polygons and overcome the constraint conditions presented by previous algorithms. The algorithm can be implemented by programs easily, and can accord with requirements of the project.关键词
等值线/包围盒/链式结构/行扫描/线段求交Key words
contours/ bounding box/ linked structure/ row scanning/ segments intersection分类
信息技术与安全科学引用本文复制引用
赵红波,张涵..一种等值线图的任意复杂多边形窗口裁剪算法[J].计算机工程与应用,2012,48(32):170-175,6.基金项目
SIC河南省科技厅项目(No.102102210212) （No.102102210212）
教育部留学回国人员科研启动基金(教外司留[2011]508号). （教外司留[2011]508号）
