Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Engineering of Surveying and Mapping》 2007-03
Add to Favorite Get Latest Update

The of fast generation constraint delaunay triangulation with constraint lines

XU Dao-zhu,LIU Hai-yan(Institute of Surveying and Mapping,Information Engineering University,Zhengzhou 450052,China)  
It presents the status of Delaunay triangulation methods,which consists of two steps,firstly,constructing Delaunay triangulation by incremental insertion algorithm,and them inserting constrained boundary by multiple diagonal exchanging algorithm to form constraint Delaunay Triangulation.In order to construct high resolution Triangulation,the algorithm uses contour line as constraint line.The two steps algorithm,will improve the algorithm for fast inserting constrained line.In incremental insertion algorithm,it organizes the point set and triangle by constructing grid index to enhance the query speed of point and the speed of searching for the triangle that contains the given point.With the improving measures,the efficiency of algorithm is greatly improved.
【Fund】: 国家自然科学基金资助项目(40401052)
【CateGory Index】: P224.2
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved