Document Open Access Logo

Online Routing in Directed Yao₄^∞ Graphs

Authors Prosenjit Bose , Jean-Lou De Carufel , John Stuart

PDF

File

Thumbnail PDF
PDF
LIPIcs.WADS.2025.9.pdf
  • Filesize: 1.38 MB
  • 22 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Sparsification and spanners
Keywords
  • Geometric Spanners
  • Yao Graphs
  • Local Routing Algorithms

Metrics

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

Abstract

The x⃑{Yao₄^∞} and x⃑{Yao₄} graphs are two families of directed geometric graphs whose vertices are points in the plane, and each vertex has up to four outgoing edges. Consider a horizontal and a vertical line through each vertex v, defining four quadrants around v. Then v has an outgoing edge to the closest vertex in each of its four quadrants. When the distance is measured using the Euclidean norm, the resulting graph is the x⃑{Yao₄} graph, whereas with the L_∞-norm, we obtain the x⃑{Yao^{∞}₄} graph, which is a sub-graph of the well-known L_∞-Delaunay graph.
In this paper, we provide a local routing algorithm with routing ratio at most 85.22 for x⃑{Yao^{∞}₄} graphs. Prior to this work, no constant spanning or routing ratios for x⃑{Yao₄^∞} graphs were previously known. Now, x⃑{Yao₄^∞} graphs are the sparsest family of directed planar graphs supporting a competitive local routing strategy. Furthermore, we show that no local routing algorithm for x⃑{Yao₄^∞} graphs can have a routing ratio lower than 7+√2≈ 8.41. Moreover, we prove that the spanning ratio is at least 5+√2≈ 6.41 in the worst case. The techniques we develop in this paper also allow us to prove lower bounds of 7-√3+√{5-2√3}≈ 6.51 and 7+√2 for the spanning and routing ratios of x⃑{Yao₄}, respectively.

Cite As Get BibTex

Prosenjit Bose, Jean-Lou De Carufel, and John Stuart. Online Routing in Directed Yao₄^∞ Graphs. In 19th International Symposium on Algorithms and Data Structures (WADS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 349, pp. 9:1-9:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.WADS.2025.9

Author Details

Prosenjit Bose
  • School of Computer Science, Carleton University, Ottawa, Canada
Jean-Lou De Carufel
  • School of Electrical Engineering and Computer Science, University of Ottawa, Canada
John Stuart
  • School of Electrical Engineering and Computer Science, University of Ottawa, Canada

Funding

This research is supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC).

References

  1. Hugo A. Akitaya, Ahmad Biniaz, and Prosenjit Bose. On the spanning and routing ratios of the directed Θ_6-graph. Comput. Geom., 105-106:101881, 2022. URL: https://doi.org/10.1016/j.comgeo.2022.101881.
  2. Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, and André van Renssen. Local routing in sparse and lightweight geometric graphs. Algorithmica, 84(5):1316-1340, 2022. URL: https://doi.org/10.1007/s00453-022-00930-2.
  3. Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, and Ge Xia. New and improved spanning ratios for Yao graphs. J. Comput. Geom., 6(2):19-53, 2015. URL: https://doi.org/10.20382/jocg.v6i2a3.
  4. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir Perkovic. Plane spanners of maximum degree six. In ICALP (1), volume 6198 of Lecture Notes in Computer Science, pages 19-30. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-14165-2_3.
  5. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir Perkovic. Tight stretch factors for L_1- and L_∞-Delaunay triangulations. Comput. Geom., 48(3):237-250, 2015. URL: https://doi.org/10.1016/j.comgeo.2014.10.005.
  6. Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, and Ge Xia. There are plane spanners of degree 4 and moderate stretch factor. Discret. Comput. Geom., 53(3):514-546, 2015. URL: https://doi.org/10.1007/s00454-015-9676-z.
  7. Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, and Michiel Smid. On the spanning and routing ratio of the directed theta-four graph. Discret. Comput. Geom., 71(3):872-892, 2024. URL: https://doi.org/10.1007/s00454-023-00597-8.
  8. Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, and Sander Verdonschot. Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci., 616:70-93, 2016. URL: https://doi.org/10.1016/j.tcs.2015.12.017.
  9. Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, and Stefanie Wuhrer. π/2-angle Yao graphs are spanners. Int. J. Comput. Geom. Appl., 22(1):61-82, 2012. URL: https://doi.org/10.1142/S0218195912600047.
  10. Prosenjit Bose, Rolf Fagerberg, André van Renssen, and Sander Verdonschot. Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. SIAM J. Comput., 44(6):1626-1649, 2015. URL: https://doi.org/10.1137/140988103.
  11. Prosenjit Bose, Darryl Hill, Michiel Smid, and Tyler Tuttle. On the spanning and routing ratios of the Yao-four graph. In ISAAC, volume 322 of LIPIcs, pages 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2024.15.
  12. Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, and Sampson Wong. Oriented spanners. In ESA, volume 274 of LIPIcs, pages 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.26.
  13. Paul Chew. There is a planar graph almost as good as the complete graph. In SCG, pages 169-177. ACM, 1986. URL: https://doi.org/10.1145/10515.10534.
  14. Mirela Damian and Naresh Nelavalli. Improved bounds on the stretch factor of y_4. Comput. Geom., 62:14-24, 2017. URL: https://doi.org/10.1016/j.comgeo.2016.12.001.
  15. Mark de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark H. Overmars. Computational geometry: algorithms and applications, 3rd Edition. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-77974-2.
  16. William Michael Zoltan Kalnay. Routing ratio of the directed Yao-6 graphs. Master’s thesis, Carleton University, Ottawa, 2023. Google Scholar
  17. Giri Narasimhan and Michiel Smid. Geometric Spanner Networks. Cambridge University Press, 2007. URL: https://doi.org/10.1017/CBO9780511546884.
  18. Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11(4):721-736, 1982. URL: https://doi.org/10.1137/0211059.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact