Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra

Nina Amenta
  • Function : Author
  • PersonId : 835271
Olivier Devillers

Abstract

We show that the Delaunay triangulation of a set of points distributed nearly uniformly on a polyhedron (not necessarily convex) of dimension p in d-dimensional space is O(n^(d-1)/p))$. For all p between 2 and d-1, this improves on the well-known worst-case bound of $O(n^ceil(d/2))$.
Fichier principal
Vignette du fichier
hal.pdf (352.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00182835 , version 1 (29-10-2007)
inria-00182835 , version 2 (08-11-2007)

Identifiers

  • HAL Id : inria-00182835 , version 2

Cite

Nina Amenta, Dominique Attali, Olivier Devillers. Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra. ACM-SIAM Symposium on Discrete Algorithms, Jan 2007, New Orleans, United States. pp.1106--1113. ⟨inria-00182835v2⟩
589 View
535 Download

Share

Gmail Facebook X LinkedIn More