求凸壳顶点的一种算法
An Algorithm for Determining the Vertex of the Convex Hull
-
摘要: 提出了一种求平面有限点集凸壳顶点的算法,并分析出该算法的时间复杂性是线性次乘法和O(nlogn)次两个数的比较。Abstract: Presents an algorithm for determining the convex hull of a finite set of points in a plane. The algorithm requires O(n) multi -plications and O(nlogn) comparisons .
下载: