Document Open Access Logo

Local Routing in Sparse and Lightweight Geometric Graphs

Authors Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2019.30.pdf
  • Filesize: 0.58 MB
  • 13 pages

Document Identifiers

Author Details

Vikrant Ashvinkumar
  • University of Sydney, Australia
Joachim Gudmundsson
  • University of Sydney, Australia
Christos Levcopoulos
  • Lund University, Sweden
Bengt J. Nilsson
  • Malmö University, Sweden
André van Renssen
  • University of Sydney, Australia

Funding

  • Gudmundsson, Joachim: Funded by the Australian Government through the Australian Research Council DP150101134 and DP180102870.
  • Levcopoulos, Christos: Swedish Research Council grants 2017-03750 and 2018-04001.

Cite AsGet BibTex

Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, and André van Renssen. Local Routing in Sparse and Lightweight Geometric Graphs. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 30:1-30:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ISAAC.2019.30

Abstract

Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no O(1)-competitive online routing algorithm exists. A notable exception is the Delaunay triangulation for which Bose and Morin [Bose and Morin, 2004] showed that there exists an online routing algorithm that is O(1)-competitive. However, a Delaunay triangulation can have Omega(n) vertex degree and a total weight that is a linear factor greater than the weight of a minimum spanning tree. We show a simple construction, given a set V of n points in the Euclidean plane, of a planar geometric graph on V that has small weight (within a constant factor of the weight of a minimum spanning tree on V), constant degree, and that admits a local routing strategy that is O(1)-competitive. Moreover, the technique used to bound the weight works generally for any planar geometric graph whilst preserving the admission of an O(1)-competitive routing strategy.

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Computational geometry
  • Spanners
  • Routing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Patrizio Angelini, Fabrizio Frati, and Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications, 14(1):19-51, 2010. Google Scholar
  2. Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, and Sander Verdonschot. Gabriel triangulations and angle-monotone graphs: Local routing and recognition. In International Symposium on Graph Drawing and Network Visualization (GD), pages 519-531, 2016. Google Scholar
  3. Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, and Michiel Smid. Improved routing on the Delaunay triangulation. In Proceedings of the 26th Annual European Symposium on Algorithms (ESA), 2018. Google Scholar
  4. Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perković, and André Van Renssen. Upper and lower bounds for online routing on Delaunay triangulations. Discrete & Computational Geometry, 58(2):482-504, 2017. Google Scholar
  5. Prosenjit Bose, Rolf Fagerberg, André van Renssen, and Sander Verdonschot. Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. SIAM Journal on Computing, 44(6):1626-1649, 2015. Google Scholar
  6. Prosenjit Bose and Pat Morin. Online routing in triangulations. SIAM Journal on Computing, 33(4):937-951, 2004. Google Scholar
  7. Paul B. Callahan and S. Rao Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 291-300, 1993. Google Scholar
  8. Raghavan Dhandapani. Greedy Drawings of Triangulations. Discrete & Computational Geometry, 43(2):375-392, 2010. Google Scholar
  9. Edgar W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1:269-271, 1959. Google Scholar
  10. Christos Levcopoulos and Andrzej Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8(1-6):251-256, 1992. Google Scholar
  11. Xiang-Yang Li and Yu Wang. Efficient construction of low weight bounded degree planar spanner. In Proceedings of the 9th Annual International Computing and Combinatorics Conference (COCOON), pages 374-384. Springer, 2003. Google Scholar
  12. Ge Xia. The stretch factor of the Delaunay triangulation is less than 1.998. SIAM Journal on Computing, 42(4):1620-1659, 2013. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact