IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
From MaRDI portal
Publication:5300011
DOI10.1142/S0218195912500161zbMath1267.68161OpenAlexW1989596220MaRDI QIDQ5300011
Gregorio Hernández, Rodrigo I. Silveira, Vera Sacristán, Manuel Abellanas, Ferran Hurtado, Maria Saumell, Mercè Claverol
Publication date: 24 June 2013
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195912500161
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Delaunay graphs are almost as good as complete graphs
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
- Augmenting the connectivity of outerplanar graphs
- A sweepline algorithm for Voronoi diagrams
- Transitions in geometric minimum spanning trees
- Algorithms for Reporting and Counting Geometric Intersections
- Improving the Stretch Factor of a Geometric Network by Edge Augmentation
- Online Routing in Triangulations
- Connectivity augmentation in plane straight line graphs
- Augmenting the Connectivity of Planar and Geometric Graphs
This page was built for publication: IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
