Document Open Access Logo

Single-Source Shortest Path Problem in Weighted Disk Graphs

Authors Shinwoo An , Eunjin Oh , Jie Xue

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.7.pdf
  • Filesize: 1.36 MB
  • 15 pages
HTML5 Logo HTML (experimental)
LIPIcs.SoCG.2025.7.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Disk graphs
  • shortest path problem
  • compressed quadtrees

Metrics

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

Abstract

In this paper, we present efficient algorithms for the single-source shortest path problem in weighted disk graphs. A disk graph is the intersection graph of a family of disks in the plane. Here, the weight of an edge is defined as the Euclidean distance between the centers of the disks corresponding to the endpoints of the edge. Given a family of n disks in the plane whose radii lie in [1,Ψ] and a source disk, we can compute a shortest path tree from a source vertex in the weighted disk graph in O(nlog² n log Ψ) time. Moreover, in the case that the radii of disks are arbitrarily large, we can compute a shortest path tree from a source vertex in the weighted disk graph in O(nlog⁴ n) time. This improves the best-known algorithm running in O(nlog⁶ n) time presented in ESA'23.

Cite As Get BibTex

Shinwoo An, Eunjin Oh, and Jie Xue. Single-Source Shortest Path Problem in Weighted Disk Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.7

Author Details

Shinwoo An
  • Pohang University of Science and Technology, South Korea
Eunjin Oh
  • Pohang University of Science and Technology, South Korea
Jie Xue
  • New York University Shanghai, China

Funding

The work by Ah and Oh was supported by Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.RS-2024-00440239, Sublinear Scalable Algorithms for Large-Scale Data Analysis) and the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No.RS-2024-00358505).

References

  1. Shinwoo An, Kyungjin Cho, and Eunjin Oh. Faster algorithms for cycle hitting problems on disk graphs. In Algorithms and Data Structures Symposium: 18th International Symposium (WADS 2023), pages 29-42, 2023. URL: https://doi.org/10.1007/978-3-031-38906-1_3.
  2. Alexander Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. Dynamic connectivity in disk graphs. Discrete & Computational Geometry, 71(1):214-277, 2024. URL: https://doi.org/10.1007/S00454-023-00621-X.
  3. Jon Louis Bentley and James B Saxe. Decomposable searching problems i. static-to-dynamic transformation. Journal of Algorithms, 1(4):301-358, 1980. URL: https://doi.org/10.1016/0196-6774(80)90015-2.
  4. Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, and Florian Sikora. QPTAS and subexponential algorithm for maximum clique on disk graphs. In 34th International Symposium on Computational Geometry (SoCG 2018), pages 11-14, 2018. Google Scholar
  5. Bruce W Brewer and Haitao Wang. An improved algorithm for shortest paths in weighted unit-disk graphs. arXiv preprint arXiv:2407.03176, 2024. URL: https://doi.org/10.48550/arXiv.2407.03176.
  6. Sergio Cabello and Miha Jejčič. Shortest paths in intersection graphs of unit disks. Computational Geometry, 48(4):360-367, 2015. URL: https://doi.org/10.1016/J.COMGEO.2014.12.003.
  7. Sergio Cabello and Wolfgang Mulzer. Minimum cuts in geometric intersection graphs. Computational Geometry, 94:101720, 2021. URL: https://doi.org/10.1016/J.COMGEO.2020.101720.
  8. Timothy M Chan and Dimitrios Skrepetos. All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. In Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), pages 24:1-24:13, 2016. URL: https://doi.org/10.4230/LIPICS.ISAAC.2016.24.
  9. Timothy M Chan and Dimitrios Skrepetos. Approximate shortest paths and distance oracles in weighted unit-disk graphs. Journal of Computational Geometry, 10(2):3-20, 2019. URL: https://doi.org/10.20382/JOCG.V10I2A2.
  10. Jared Espenant, J Mark Keil, and Debajyoti Mondal. Finding a maximum clique in a disk graph. In 39th International Symposium on Computational Geometry (SoCG 2023), volume 258, page 30, 2023. Google Scholar
  11. Jie Gao and Li Zhang. Well-separated pair decomposition for the unit-disk graph metric and its applications. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (STOC 2003), pages 483-492, 2003. URL: https://doi.org/10.1145/780542.780613.
  12. Sariel Har-Peled. Geometric approximation algorithms, volume 173 of Mathematical Surveys and Monographs. American Mathematical Society, 2011. Google Scholar
  13. Haim Kaplan, Matthew J Katz, Rachel Saban, and Micha Sharir. The unweighted and weighted reverse shortest path problem for disk graphs. In the proceedings of the 31st Annual European Symposium on Algorithms (ESA 2023), pages 67:1-67:14, 2023. URL: https://doi.org/10.4230/LIPICS.ESA.2023.67.
  14. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, and Micha Sharir. Dynamic planar voronoi diagrams for general distance functions and their algorithmic applications. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pages 2495-2504, 2017. URL: https://doi.org/10.1137/1.9781611974782.165.
  15. Katharina Klost. An algorithmic framework for the single source shortest path problem with applications to disk graphs. Computational Geometry, 111:101979, 2023. URL: https://doi.org/10.1016/J.COMGEO.2022.101979.
  16. Chih-Hung Liu. Nearly optimal planar k nearest neighbors queries under general distance functions. SIAM Journal on Computing, 51(3):723-765, 2022. Google Scholar
  17. Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi. A framework for approximation schemes on disk graphs. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), pages 2228-2241, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH84.
  18. Franco P Preparata and Michael I Shamos. Computational geometry: an introduction. Springer Science & Business Media, 2012. Google Scholar
  19. Daniel D Sleator and Robert Endre Tarjan. A data structure for dynamic trees. In Proceedings of the thirteenth annual ACM symposium on Theory of computing (STOC 1981), pages 114-122, 1981. Google Scholar
  20. Haitao Wang and Jie Xue. Near-optimal algorithms for shortest paths in weighted unit-disk graphs. Discrete & Computational Geometry, 64(4):1141-1166, 2020. URL: https://doi.org/10.1007/S00454-020-00219-7.
  21. Haitao Wang and Yiming Zhao. Improved algorithms for distance selection and related problems. In 31st Annual European Symposium on Algorithms (ESA 2023), volume 274, page 101, 2023. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.101.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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