Nice point sets can have nasty Delaunay triangulations

DOI10.1007/s00454-003-2927-4zbMath1038.68129OpenAlexW2048516789MaRDI QIDQ1404533

Jeff Erickson

Publication date: 21 August 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-2927-4

zbMATH Keywords

geometric constraints

Mathematics Subject Classification ID

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

Related Items (9)

The visible perimeter of an arrangement of disks ⋮ Neighborly inscribed polytopes and Delaunay triangulations ⋮ A tight bound for the Delaunay triangulation of points on a polyhedron ⋮ A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations ⋮ Meshes Preserving Minimum Feature Size ⋮ On the number of facets of three-dimensional Dirichlet stereohedra. III: Full cubic groups ⋮ Local polyhedra and geometric graphs ⋮ Randomized incremental construction of Delaunay triangulations of nice point sets ⋮ Smoothed analysis of probabilistic roadmaps

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