对于给定的初始点集P，有多种三角网剖分方式，其中Delaunay三角网具有以下特征：
1、Delaunay三角网是唯一的；
2、三角网的外边界构成了点集P的凸多边形“外壳”；
3、没有任何点在三角形的外接圆内部，反之，如果一个三角网满足此条件，那么它就是Delaunay三角网。
4、如果将三角网中的每个三角形的最小角进行升序排列，则Delaunay三角网的排列得到的数值最大，从这个意义上讲，Delaunay三角网是“最接近于规则化的“的三角网。
For given initial point set P, a variety of Triangulation, Delaunay triangulation has the following characteristics: 1, Delaunay triangulation is unique 2, the outer boundary of the triangle network constitutes a convex set of points P polygon " shell" 3, did not at any point inside the circumcircle of the triangle, on the contrary, if a triangular network satisfy this condition, then it is the Delaunay triangulation. 4, if the minimum angle of each triangle in the triangulation network in ascending order, Delaunay triangulation arrangement numerical maximum, in this sense, Delaunay triangulation is the closest to the rules of the " triangle net. (2012-09-12, C/C++, 110KB, 下载37次)
C++实现演化效果，很不错的例子，我也是从网上当得，大家可以看看
Evolution of C++ to achieve results, it is a good example, I also get from the Internet when we can see (2010-07-23, C/C++, 118KB, 下载5次)