Outerplanar Graphs and Delaunay Triangulations
From MaRDI portal
Publication:2891323
DOI10.1007/978-3-642-27654-5_25zbMath1353.68274MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
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