Fast Improved Delaunay Triangulation Algorithm
Xie Yong-qiang, Pla Uni · Jisuanji fangzhen · 2006
The algorithms of Delaunay triangulation are the main algorithms when establishing DEM. The algorithm of going forward beginning with margins was improved in two ways after some researches are made on several Delaunay triangulation algorithms. On one hand, the edges were used as the base when going forward, other than Vononoi figure as the base. On the other hand, data set partition was used to limit the range of searching. Consequently, the speed of constructing Delaunay triangle was greatly improved. The result of simulating shows that the efficiency of mended algorithm is evidently enhanced.