摘要
对于多边形OFFSET后产生的自交环现象,提出一种求解自交点的基于单调链的平面扫描算法,并对环的判别提出了一种简便而有效的方法。最后,对算法的时间复杂度进行了分析。实验表明,该算法高效而稳定地处理多边形OFFSET后产生的自交环。
This paper present a sweep-line algorithm based on monotone chains to find intersections, at the meantime. A simple and effective method is proposed for identifying invalid loops. At the last, the time-complexity of the algorithm is analyzed. Empirical tests show that the proposed algorithm is effective and steady in disposing the loop of offsetting polygons.
出处
《工程图学学报》
CSCD
北大核心
2005年第3期44-49,共6页
Journal of Engineering Graphics
基金
国家"十五"863基金资助项目(2001AA421160)