This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.

提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。

youdao

Meanwhile, the sufficient and necessary condition for the orientation of an arbitrary simple polygon is given.

同时，给出了任意简单多边形走向的充要条件。

youdao

This algorithm can quickly report if kernel of simple polygon is empty, and can quickly get the point list of the kernel when the kernel exists.

该算法可以较快地对多边形的核为空的情况加以报告，而且在有核的情况下快速求解到核多边形的顶点序列。

youdao

This paper inspects the properties in constitution of kernel of simple polygon, and a new algorithm for calculating the kernel of a simple polygon is proposed combined with the existing achievement.

考察了简单多边形的核在构成方面的性质，结合已有的成果，提出了一种求简单多边形核的新算法。

youdao

This paper inspects the properties in constitution of kernel of simple polygon, and a new algorithm for calculating the kernel of a simple polygon is proposed combined with the existing achievement.

考察了简单多边形的核在构成方面的性质，结合已有的成果，提出了一种求简单多边形核的新算法。

youdao