Outerplanar Graphs and Delaunay Triangulations

DOI10.1007/978-3-642-27654-5_25zbMath1353.68274OpenAlexW132180276MaRDI QIDQ2891323

Igor Rivin, Ashraful Alam, Ileana Streinu

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_25

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• An optimal algorithm for realizing a Delaunay triangulation
• Realizability of Delaunay triangulations
• Euclidean structures on simplicial surfaces and hyperbolic volume
• Graph-theoretical conditions for inscribability and Delaunay realizability
• A characterization of ideal polyhedra in hyperbolic 3-space
• A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere

This page was built for publication: Outerplanar Graphs and Delaunay Triangulations