arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.0917cs.GRcs.CG
收藏

Weiler-Atherton算法在处理自相交多边形中的推广

An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon

Anurag Chakraborty

摘要:

本文提出了一种新的算法,它可以解决Weiler-Atherton算法的问题。WeilerAtherton算法的问题在于裁剪自相交多边形。Weiler-Atherton算法没有考虑裁剪自相交多边形,这也是该算法的一个主要缺点。在新算法中,将自相交多边形分割成非自相交的轮廓,然后对这些子多边形执行WeilerAtherton裁剪算法。对于孔,我们必须存储的边缘,不是自己的边界孔轮廓从最近裁剪的多边形。因此,如果两个轮廓都是洞,那么我们必须存储最近裁剪的多边形的所有边。最后,通过消除所有存储的边来产生结果多边形。

英文摘要:

In this paper a new algorithm has been proposed which can fix the problem of Weiler Atherton algorithm. The problem of Weiler Atherton algorithm lies in clipping self intersecting polygon. Clipping self intersecting polygon is not considered in Weiler Atherton algorithm and hence it is also a main disadvantage of this algorithm. In our new algorithm a self intersecting polygon has been divided into non self intersecting contours and then perform the Weiler Atherton clipping algorithm on those sub polygons. For holes we have to store the edges that is not own boundary of hole contour from recently clipped polygon. Thus if both contour is hole then we have to store all the edges of the recently clipped polygon. Finally the resultant polygon has been produced by eliminating all the stored edges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑