Abstract
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 complexity of the Delaunay triangulation of points in R3 may be quadratic in the worst case, we show in this paper that it is only linear when the points are distributed on a fixed set of well-sampled facets of R3 (e.g. the planar polygons in a polyhedron). Our bound is deterministic and the constants are explicitly given.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Attali, D., Boissonnat, JD. A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. Discrete Comput Geom 31, 369–384 (2004). https://doi.org/10.1007/s00454-003-2870-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-003-2870-4