Graham Scan algorithm for convex hull calculation.
凸包算法。
静态
The Point list.
可选
The minimum polygon vertex set.
Find the minimum polygon vertex set that includes all points.
寻找包括所有点的最小多边形顶点集合。
The [x,y...] list.
The output array to store the result. If not provided, a new array will be created.
En
Graham Scan algorithm for convex hull calculation.
Zh
凸包算法。