改进的Delaunay三角网渐次插入生成算法.PDFVIP

34 17 2008 9 Vol.34 No.17 Computer Engineering September 2008 ·· 2008 A TP301.6 Delaunay ( 200240) Delaunay LOP Delaunay Delaunay Delaunay Improved Gradual Imbedding Generation Algorithm for Delaunay Triangulated Network XU Jian-zhong, MA Li-zhuang (Computer Science Department, School of Electronic, Information and Electrical Engineering, Shanghai Jiaotong University, Shanghai 200240) AbstractThis paper introduces an improved gradual imbedding generation algorithm for Delaunay triangulated network. The data points are inserted sequentially to construct Delaunay triangulated network without additional sorting operation. Based on the original insertion, the algorithm improves the efficiency of Local Optimization Procedure(LOP) algorithm by updating adjacent triangles, which uses Delaunay rules upon the triangles formed by changing diagonal lines. Experiment indicates that the algorithm can improve the efficiency of the former one and accelerate the generation of Delaunay triangulated network. Key wordsDelaunay triangulation; gradual imbedding; Local Optimization Procedure(LOP) algorithm 1 d(v , v )v , v i j i j x V(i)={x E |d(x , v ) d(x , v ), j =1,2,,N ,j ≠i} 2 i j Voronoi (V-) V- V- (Digital Terrain V- V Model, DTM) DTM