Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Technology and Development》 2006-07
Add to Favorite Get Latest Update

Fast Algorithm for Delaunay Triangulation of Simple Polygon Based on Maximum Triangle Weights

LIU Jian-xin,LU Xin-ming,YUE Hao (Sch.of Info.Sci.and Eng.,Shandong Univ.of Sci.and Techn.,Qingdao 266510,China)  
The Delaunay triangulation of simple polygon,being basic methods of calculating geometry,has been widely applied to computer graphics,3D geographic modeling. This paper presents a fast algorithm for Delaunay triangulation of simple polygon based on maximum triangle weights referring to others.The state of triangle is best or better in the result of triangulation.The correctness and efficiency of the algorithm are confirmed strictly and the algorithm's time complexity is illustrated.Finally an example is given.The tested analysis shows that for simple polygonal domains randomly generated,the algorithm is efficient in computation and has an almost linear in running time.
【CateGory Index】: TP391.41
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