高级检索

多边形链求交的改进算法

An Improved Algorithm for Polygonal Chain Intersection

  • 摘要: 多边形链求交是CAD&CG及相关领域研究中的一个基本问题.利用多边形链的凸凹性、单调性等特性,结合包围盒技术,在扫描线算法基础上,提出一种多边形链求交的改进算法.该算法特别适用于包含大量直线段且交点数相对于顶点数少得多的多边形链求交的情况.

     

    Abstract: Finding intersections with a polygonal chain or among several chains is the fundamental operations in CAD/CAM and CG.By using monotony and convexity-concavity of polygonal chain as well as box technique,an improved algorithm for polygonal chain intersection is proposed based on the line scan conversion algorithm.The proposed algorithm is best suited for finding intersections among polygonal chains with densely spaced vertices.

     

/

返回文章
返回