Complexity of the Delaunay triangulation of points on polyhedral surfaces
From MaRDI portal
Publication:1434252
DOI10.1007/s00454-003-2824-xzbMath1050.52012OpenAlexW2031953823MaRDI QIDQ1434252
Dominique Attali, Jean-Daniel Boissonnat
Publication date: 7 July 2004
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-003-2824-x
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Related Items
Cites Work
- Higher-dimensional Voronoi diagrams in linear expected time
- The expected number of \(k\)-faces of a Voronoi diagram
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
- Smooth surface reconstruction via natural neighbour interpolation of distance functions
- Surface reconstruction by Voronoi filtering
- Mathematical theory of medial axis transform
- On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
- DETECTION OF RIDGES AND RAVINES BASED ON CAUSTIC SINGULARITIES
- Nice point sets can have nasty Delaunay triangulations
- Natural neighbor coordinates of points on a surface
- The medial axis of a union of balls
