A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2002

A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces

Jean-Daniel Boissonnat
  • Fonction : Auteur
  • PersonId : 830857

Résumé

Delaunay triangulations and Voronoi diagrams have found numerous applications in surface modeling, surface mesh generation, deformable surface modeling and surface reconstruction. Many algorithms in these applications begin by constructing the three-dimensional Delaunay triangulation of a finite set of points scattered over a surface. Their running-time therefore depends on the complexity of the Delaunay triangulation of such point sets. Although the Delaunay triangulation of points in ^3 can be quadratic in the worst-case, we show that, under some mild sampling condition, the complexity of the 3D Delaunay triangulation of points distributed on a fixed number of facets of ^3 (e.g. the facets of a polyhedron) is linear. Our bound is deterministic and the constants are explicitly given.
Fichier principal
Vignette du fichier
RR-4453.pdf (291.22 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00072135 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00072135 , version 1

Citer

Dominique Attali, Jean-Daniel Boissonnat. A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces. [Research Report] RR-4453, INRIA. 2002. ⟨inria-00072135⟩
77 Consultations
239 Téléchargements

Partager

Gmail Facebook X LinkedIn More