Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
Find a planar point set the distance between two points of a recent algorithm, VS2010 compile.
说明：求一个平面点集最近的两点间距离的算法实现，VS 2010编译通过。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
The purpose of step is to partition planar point set and to simplify the calculation distance from a point to a straight line.
然后进一步详细地给出了一种改进的求平面任意散乱点集凸包的新算法。
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）。
The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented.
提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented.
提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
应用推荐