Complexity of the delaunay triangulation of points on surfaces the smooth case

DOI10.1145/777792.777823zbMath1374.68638OpenAlexW2051200663MaRDI QIDQ5361624

Jean-Daniel Boissonnat, Dominique Attali, André Lieutier

Publication date: 29 September 2017

Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/777792.777823

zbMATH Keywords

complexityVoronoi diagramreconstructionDelaunay triangulationsmooth surfacesgeneric surfaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Practical distribution-sensitive point location in triangulations ⋮ Delaunay triangulations approximate anchor hulls ⋮ Learning smooth shapes by probing ⋮ Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space ⋮ Discrete normal vector field approximation via time scale calculus ⋮ A tight bound for the Delaunay triangulation of points on a polyhedron ⋮ A simple algorithm for higher-order Delaunay mosaics and alpha shapes ⋮ Multi-region Delaunay complex segmentation ⋮ Unnamed Item ⋮ The implicit structure of ridges of a smooth parametric surface ⋮ Provable surface reconstruction from noisy samples ⋮ Randomized incremental construction of Delaunay triangulations of nice point sets ⋮ RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point ⋮ Provably correct reconstruction of surfaces from sparse noisy samples