Incremental Inserting Algorithm for D-TIN Constructing Realization

摘要

This paper has researched how to use incremental inserting algorithm to build delaunay triangulation net work, explained in detail how to construct a rectangular bunding box for the initial triangulation; how to determine the relationship between the point to be inserted and the triangle, and analyzed the results of the different subdivision based on the different relationship. It has also researched how to detect whether a new generation of triangular net fits the empty circle rules, how to have local optimal procedure in illicit triangle through the exchange of diagonal. Experiments show that the delaunay triangulation constructed thought the use of point by point insertion algorithm can reflect the topographical features very well, have a higher efficiency.