The Implement of an Improved Delaunay Triangulation Algorithm

The algorithms of Delaunay triangulation are the main algorithms when establishing DEM. The algorithm of going forward beginning with margins has been improved in two ways after some researches are made on several Delaunay triangulation algorithms. On the one hand, edges are directly used as the base when going forward, other than using Voronoi figure as the base. On the other hand, data set partition is used to limit the range of searching. Consequently, the speed of constructing Delaunay triangular mesh is greatly improved. The result of simulating shows that the efficiency of mended algorithm is evidently enhanced.