Summary: Complexity of Delaunay triangulation for points on
lower-dimensional polyhedra
Nina Amenta
UC Davis
Dominique Attali
CNRS-LIS Grenoble
Olivier Devillers
INRIA Sophia-Antipolis
Abstract
We show that the Delaunay triangulation of a set of points
distributed nearly uniformly on a polyhedron (not neces-
sarily convex) of dimension p in d-dimensional space is
O(n(d-1)/p
). For all 2 p d - 1, this improves on the
well-known worst-case bound of O(n d/2
).
1 Introduction
The Delaunay triangulation of a set of points is a data struc-
ture, which in low dimensions has applications in mesh gen-
eration, surface reconstruction, molecular modeling, geo-

Source: Amenta, Nina - Department of Computer Science, University of California, Davis

Collections: Biology and Medicine; Computer Technologies and Information Sciences