摘要
对于任意给定的一簇互不相交的简单多边形,本文提出一种旨在确定簇中多边形之间包含关系的扫描线法,并对其正确性和复杂性作出分析。
This paper presents a plane sweep algorithm for determing the enclosure relations among a family of non intersection simple polygons. The correctness and complexities of the algorithm are analysed. The practice shows that the algorithm is very efficient.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
1997年第2期157-163,共7页
Journal of Computer-Aided Design & Computer Graphics
关键词
多边形
扫描线法
算法
计算机
simple polygon, enclosure relation, plane sweep, correctness of algorithm, complexity.