编写一个一趟遍历算法，并且只使用o(1)的额外空间来确定路径是否自相交。
Write a one-pass algorithm with o (1) extra space to determine, if your path crosses itself, or not.
利用前者填充边自相交的多边形区域需要做大量排序操作，这极大降低了填充效率；
But using the former to fill polygons with edge self-intersection needs large of taxes, affecting filling efficiency greatly.
针对血管树表面重建中的自相交问题，提出一种新型顶点融合技术，给出了融合点的计算方法。
Then a novel technique of vertex merging is proposed to deal with the problem of self-intersection.
应用推荐