Delaunay三角剖分算法 . 一个非常强劲的VC编的Delaunay三角网生成算法，对您学习VC++或GIS的学习都有很好的帮助作用-In mathematics, and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation　they tend to avoid skinny triangles. The triangulation was invented by Boris Delaunay in 1934 [1].



Based on Delaunay s definition[1], the circumcircle of a triangle formed by three points from the original point set is empty if it does not contain vertices other than the three that define it (other points are permitted only on the very perimeter, not inside).



The Delaunay condition states that a triangle net is a Delaunay triangulation if all the circumcircles of all the triangles in the net are empty. This is the original definition for two-dimensional spaces. It is possible to use it in three-dimensional spaces by using a circumscribed sphere in place of the circumcircl