Find a planar point set the distance between two points of a recent algorithm, VS2010 compile.
说明:求一个平面点集最近的两点间距离的算法实现,VS 2010编译通过。
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.
提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
应用推荐