Generation And Application Of Delaunay Triangulated Irregular Network

The Delaunay triangulation is an aggregate of connected but nonoverlapping triangles, and the circumcircle of each triangle contains no other point in its interior. It is the best one of the surface morphology, and is commonly used to generate used to generate triangulated irregular network(TIN).In this paper, the algorithms of building constrained Delaunay triangulation is discussed, a software system based on it is developed, and some researches are done on the contour map. The main works are as follows:1, An algorithm of generating constrained Delaunay triangulation is given, which takes the advantages of divide-conquer and incremental insertion;2, Flat triangles are removed; 3, Points can be dynamically inserting in TIN; 4, Constrained Segments can be dynamically inserting in TIN; 5, The contours can be inserting in TIN; 6, Generating regular Grid file from TIN.