Based on the Curvilinear Integral and its sorted edge table, a new polygon fill algorithm is developed in the article.
文章结合代数曲线积分思想与活性边表技术，提出了一种新的任意多边形代数积分算法。
At the same time the author points out that the polygon vertexes can be sorted clockwise or anticlockwise by judging the sign of the vector polygon area.
同时指出可以通过判断矢量多边形面积的正负值将多边形的顶点按照顺时针或逆时针方向排序。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
应用推荐