Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
From MaRDI portal
Publication:1764170
DOI10.1007/s00454-004-1089-3zbMath1077.68108OpenAlexW3138782396MaRDI QIDQ1764170
Publication date: 23 February 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-004-1089-3
Related Items (7)
The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Computing convex quadrangulations ⋮ Neighborly inscribed polytopes and Delaunay triangulations ⋮ Multi-region Delaunay complex segmentation ⋮ Light Euclidean Spanners with Steiner Points ⋮ Unnamed Item ⋮ Randomized incremental construction of Delaunay triangulations of nice point sets
This page was built for publication: Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty