Istituto di Scienza e Tecnologie dell'Informazione     
Cignoni P., Montani C., Scopigno R. DeWall: a fast divide and conquer Delaunay triangulation algorithm in E(d). 1998.
The paper deals with Delaunay Triangulations (DT) in Ed space. This classic computational geometry problem is studied from the point of view of the efficiency, extendibility to any dimensionality, and ease of implementation. A new solution to DT is proposed, 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 be simply extended to triangulate point sets in any dimension. The technique adopted is very efficient and presents a subquadratic behaviour in real applications in E3, although its computational complexity does not improve the theoretical bounds reported in the literature. An evaluation of the performance on a number of datasets is reported, together with a comparison with other DT algorithms.
DOI: 10.1016/S0010-4485(97)00082-1
Subject Delaunay triangulation
Divide and conquer
Uniform grids
I.3 Computer Graphics

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional