Nice point sets can have nasty Delaunay triangulations

DOI10.1145/378583.378636zbMath1375.68128OpenAlexW2064436582MaRDI QIDQ5361564

Jeff Erickson

Publication date: 29 September 2017

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

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

zbMATH Keywords

lower boundssurface reconstructionDelaunay triangulationspreadsample measure\(\varepsilon\)-sample

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes ⋮ Collision detection for deforming necklaces ⋮ The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Complexity of the Delaunay triangulation of points on polyhedral surfaces ⋮ Unnamed Item ⋮ Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions ⋮ Quality mesh generation for molecular skin surfaces using restricted union of balls

This page was built for publication: Nice point sets can have nasty Delaunay triangulations