DeWall A fast divide and conquer Delaunay triangulation algorithm in Ed.pdf英文资料.pdfVIP

DeWall: A Fast Divide Conquer Delaunay Triangulation Algorithm in E d z z ? P. Cignoni , C. Montani , R. Scopigno z I.E.I. { Consiglio Nazionale delle Ricerche, Via S. Maria 46, 56126 Pisa, ITALY E-mail: fcignoni, montani g@iei.pi .cnr.it ? CNUCE { Consiglio Nazionale delle Ricerche , Via S. Maria 36, 56126 Pisa, ITALY E-mail: r.scopigno@r.it Octob er 1, 1997 Abstract The pap er deals with Delaunay Triangulations (DT) in E d space. This classic computational geometry problem is studied from the p oint of view of the eciency, extendibility to any dimensionality, and ease of implementation. A new solution to DT is prop osed, based on an original interpretation of the well- known Divide and Conquer paradigm. One of the main characteristics of this new algorithm is its generality: it can b e simply extended to triangulate p oint sets in any dimension. The technique adopted is very ecient and presents a sub quadratic b ehaviour in real applications in E 3 , although its computational complexity do es not improve the theoretical b ounds rep orted in the literature. An evaluation of the p erformance on a numb er of datasets is rep orted, together with a comparison with other DT algorithms. Keywords: Delaunay triangulation, Divide Conquer, Uniform Grids. Corresp ondence address: R. Scopigno, CNUCE - C.N.R., v. S. Maria 36, 56126 Pisa, Phone: +39 50 593304 , E-mail: r.scopigno@r.it Abbreviated article title: \D