The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set. That is Point Set Coordinate Rotation Algorithm(PSCR).
提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法（PSCR）。
This is why the convex hull algorithm front of some preparation work!
这个正是凸包算法前面的一些准备工作！
The second algorithm is that polygonal concave points and newly created concave points are continuously removed, and a vertex sequence of the convex hull is finally obtained.
第二个算法不断删去多边形的凹点及新产生的凹点，最后得到凸壳顶点序列。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
应用推荐