Nice point sets can have nasty Delaunay triangulations
From MaRDI portal
Publication:1404533
DOI10.1007/s00454-003-2927-4zbMath1038.68129MaRDI QIDQ1404533
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Meshes Preserving Minimum Feature Size, The visible perimeter of an arrangement of disks, 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, On the number of facets of three-dimensional Dirichlet stereohedra. III: Full cubic groups, Smoothed analysis of probabilistic roadmaps, Neighborly inscribed polytopes and Delaunay triangulations, Local polyhedra and geometric graphs, Randomized incremental construction of Delaunay triangulations of nice point sets