一种改进的Delaunay三角剖分算法的实现.pdfVIP

2010 Third International Conference on Information and Computing2010 Third International Conference on Information and Computing The Implement of an Improved Delaunay Triangulation Algorithm HE Jun WANG Meng-lin 1st Department PLA Commanding Communications Academy Wuhan, China e-mail: hjlzc@126.com Abstract—The algorithms of Delaunay triangulation are the main algorithms when establishing DEM. The algorithm of 2 THE ALGORITHM OF GOING FORWARD BEGINNING going forward beginning with margins has been improved in WITH MARGINS two ways after some researches are made on several Delaunay triangulation algorithms. On the one hand, edges are directly In the algorithm of going forward beginning with used as the base when going forward, other than using Voronoi margins, the convex hull which contains all discrete points is figure as the base. On the other hand, data set partition is used firstly established, and then it inwards pushes until the to limit the range of searching. Consequently, the speed of Delaunay triangulation network is completed. The process is constructing Delaunay triangular mesh is greatly improved. as follows. The result of simulating shows that the efficiency of mended 1) Taking out an orientational edge e from the li