Description: 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.
To Search:
File list (Check if you may need any files):
triangle.c
triangle.h
Download