Upper and Lower Bounds for Online Routing on Delaunay Triangulations
From MaRDI portal
Publication:3452783
DOI10.1007/978-3-662-48350-3_18zbMath1378.68155arXiv1501.01783OpenAlexW1678825575MaRDI QIDQ3452783
Jean-Lou De Carufel, Prosenjit Bose, André van Renssen, Ljubomir Perković, Nicolas Bonichon
Publication date: 19 November 2015
Published in: Algorithms - ESA 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01783
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Signed and weighted graphs (05C22) Online algorithms; streaming algorithms (68W27)
Related Items
Improved routing on the Delaunay triangulation, Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition, Unnamed Item
Cites Work
- A note on two problems in connexion with graphs
- On plane geometric spanners: a survey and open problems
- Delaunay graphs are almost as good as complete graphs
- On plane constrained bounded-degree spanners
- There are planar graphs almost as good as the complete graph
- Efficiently navigating a random Delaunay triangulation
- The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
- The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations
- Competitive Online Routing on Delaunay Triangulations
- Geometric Spanner Networks
- Online Routing in Triangulations
