A simple method for resolving degeneracies in Delaunay triangulations

DOI10.1007/3-540-56939-1_71zbMath1418.68226OpenAlexW1532888136MaRDI QIDQ4630259

Warren D. Smith, Michael B. Dillencourt

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://escholarship.org/uc/item/3mb5918w

zbMATH Keywords

convex hullDelaunay triangulationDelaunay tessellationsimple polygonouter face

Mathematics Subject Classification ID

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

Related Items (4)

Novel concave hull-based heuristic algorithm for TSP ⋮ Graph-theoretical conditions for inscribability and Delaunay realizability ⋮ GPU based detection of topological changes in Voronoi diagrams ⋮ Approximate proximity drawings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toughness and Delaunay triangulations
• Realizability of Delaunay triangulations
• Traveling salesman cycles are not always subgraphs of Voronoi duals
• Voronoi diagrams from convex hulls
• A characterization of ideal polyhedra in hyperbolic 3-space
• On geometry of convex ideal polyhedra in hyperbolic 3-space
• Tough graphs and Hamiltonian circuits.
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
• A General Approach to Removing Degeneracies

This page was built for publication: A simple method for resolving degeneracies in Delaunay triangulations