In this paper,A new parallel algorithm was proposed by combining improved fast convex hull algorithm of planar point set based on sorted simple polygon in this paper. The worst-case time complexity of the algorithm was O(n).
提出了在基于有序简单多边形的平面点集凸包快速求取算法基础上改进的并行算法,该算法的时间复杂度达到了O(n)。
参考来源 - 平面点集凸包的并行算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
Meanwhile, the sufficient and necessary condition for the orientation of an arbitrary simple polygon is given.
同时，给出了任意简单多边形走向的充要条件。
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.
该算法可以较快地对多边形的核为空的情况加以报告，而且在有核的情况下快速求解到核多边形的顶点序列。
应用推荐