Document Open Access Logo

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique

Authors Timothy M. Chan , Zhengcheng Huang

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.32.pdf
  • Filesize: 0.74 MB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Geometric optimization problems
  • parametric search
  • shortest path
  • disk graphs
  • Fréchet distance
  • visibility
  • distance selection
  • randomized algorithms

Metrics

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

Abstract

In a series of papers, Avraham, Filtser, Kaplan, Katz, and Sharir (SoCG'14), Kaplan, Katz, Saban, and Sharir (ESA'23), and Katz, Saban, and Sharir (ESA'24) studied a class of geometric optimization problems - including reverse shortest path in unweighted and weighted unit-disk graphs, discrete Fréchet distance with one-sided shortcuts, and reverse shortest path in visibility graphs on 1.5-dimensional terrains - for which standard parametric search does not work well due to a lack of efficient parallel algorithms for the corresponding decision problems. The best currently known algorithms for all the above problems run in O^*(n^{6/5}) = O^*(n^{1.2}) time (ignoring subpolynomial factors), and they were obtained using a technique called shrink-and-bifurcate. We improve the running time to Õ(n^{8/7}) ≈ O(n^{1.143}) for these problems. Furthermore, specifically for reverse shortest path in unweighted unit-disk graphs, we improve the running time further to Õ(n^{9/8}) = Õ(n^{1.125}).

Cite As Get BibTex

Timothy M. Chan and Zhengcheng Huang. Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 32:1-32:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.32

Author Details

Timothy M. Chan
  • Siebel School of Computing and Data Science, University of Illinois at Urbana-Champaign, IL, USA
Zhengcheng Huang
  • Siebel School of Computing and Data Science, University of Illinois at Urbana-Champaign, IL, USA

Funding

  • Chan, Timothy M.: Work supported by NSF Grant CCF-2224271.

References

  1. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, and Subhash Suri. Selecting distances in the plane. Algorithmica, 9(5):495-514, 1993. URL: https://doi.org/10.1007/BF01187037.
  2. Pankaj K. Agarwal and Jeff Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, pages 1-56. AMS Press, 1999. Google Scholar
  3. Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, and Micha Sharir. Segment proximity graphs and nearest neighbor queries amid disjoint segments. In Proc. 32nd Annual European Symposium on Algorithms (ESA), volume 308 of LIPIcs, pages 7:1-7:20, 2024. URL: https://doi.org/10.4230/LIPICS.ESA.2024.7.
  4. Pankaj K. Agarwal, Matthew J. Katz, and Micha Sharir. On reverse shortest paths in geometric proximity graphs. Comput. Geom., 117:102053, 2024. Preliminary version in ISAAC 2022. URL: https://doi.org/10.1016/J.COMGEO.2023.102053.
  5. Pankaj K. Agarwal and Micha Sharir. Efficient algorithms for geometric optimization. ACM Comput. Surv., 30(4):412-458, 1998. URL: https://doi.org/10.1145/299917.299918.
  6. Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, and Micha Sharir. The discrete and semicontinuous Fréchet distance with shortcuts via approximate distance counting and selection. ACM Trans. Algorithms, 11(4):29:1-29:29, 2015. Preliminary version in SoCG 2014. URL: https://doi.org/10.1145/2700222.
  7. Sergio Cabello and Miha Jejčič. Shortest paths in intersection graphs of unit disks. Comput. Geom., 48(4):360-367, 2015. URL: https://doi.org/10.1016/J.COMGEO.2014.12.003.
  8. Timothy M. Chan. Geometric applications of a randomized optimization technique. Discret. Comput. Geom., 22(4):547-567, 1999. URL: https://doi.org/10.1007/PL00009478.
  9. Timothy M. Chan. On enumerating and selecting distances. Int. J. Comput. Geom. Appl., 11(3):291-304, 2001. URL: https://doi.org/10.1142/S0218195901000511.
  10. Timothy M. Chan. An optimal randomized algorithm for maximum Tukey depth. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 430-436, 2004. URL: http://dl.acm.org/citation.cfm?id=982792.982853.
  11. Timothy M. Chan, Sariel Har-Peled, and Mitchell Jones. Optimal algorithms for geometric centers and depth. SIAM J. Comput., 51(3):627-663, 2022. URL: https://doi.org/10.1137/21M1423324.
  12. Timothy M. Chan and Dimitrios Skrepetos. All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. In Proc. 27th International Symposium on Algorithms and Computation (ISAAC), volume 64 of LIPIcs, pages 24:1-24:13, 2016. URL: https://doi.org/10.4230/LIPICS.ISAAC.2016.24.
  13. Timothy M. Chan and Da Wei Zheng. Hopcroft’s problem, log^* shaving, two-dimensional fractional cascading, and decision trees. ACM Trans. Algorithms, 20(3):24, 2024. URL: https://doi.org/10.1145/3591357.
  14. Richard Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM, 34(1):200-208, 1987. URL: https://doi.org/10.1145/7531.7537.
  15. Mark de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark H. Overmars. Computational Geometry: Algorithms and Applications. Springer, 3rd edition, 2008. URL: https://www.worldcat.org/oclc/227584184, URL: https://doi.org/10.1007/978-3-540-77974-2.
  16. Michael B. Dillencourt, David M. Mount, and Nathan S. Netanyahu. A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl., 2(1):1-27, 1992. URL: https://doi.org/10.1142/S0218195992000020.
  17. Alon Efrat, Alon Itai, and Matthew J Katz. Geometry helps in bottleneck matching and related problems. Algorithmica, 31:1-28, 2001. URL: https://doi.org/10.1007/s00453-001-0016-8.
  18. Greg N. Frederickson and Donald B. Johnson. The complexity of selection and ranking in X+Y and matrices with sorted columns. J. Comput. Syst. Sci., 24(2):197-208, 1982. URL: https://doi.org/10.1016/0022-0000(82)90048-4.
  19. Greg N. Frederickson and Donald B. Johnson. Generalized selection and ranking: Sorted matrices. SIAM J. Comput., 13(1):14-30, 1984. URL: https://doi.org/10.1137/0213002.
  20. Te C. Hu. The maximum capacity route problem. Operations Research, 9(6):898-900, 1961. Google Scholar
  21. Haim Kaplan, Matthew J. Katz, Rachel Saban, and Micha Sharir. The unweighted and weighted reverse shortest path problem for disk graphs. In Proc. 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 67:1-67:14, 2023. URL: https://doi.org/10.4230/LIPICS.ESA.2023.67.
  22. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, and Micha Sharir. Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. Discret. Comput. Geom., 64(3):838-904, 2020. URL: https://doi.org/10.1007/S00454-020-00243-7.
  23. Matthew J. Katz, Rachel Saban, and Micha Sharir. Near-linear algorithms for visibility graphs over a 1.5-dimensional terrain. In Proc. 32nd Annual European Symposium on Algorithms (ESA), volume 308 of LIPIcs, pages 77:1-77:17, 2024. URL: https://doi.org/10.4230/LIPICS.ESA.2024.77.
  24. Matthew J. Katz and Micha Sharir. An expander-based approach to geometric optimization. SIAM J. Comput., 26(5):1384-1408, 1997. URL: https://doi.org/10.1137/S0097539794268649.
  25. Jirí Matoušek. Randomized optimal algorithm for slope selection. Inf. Process. Lett., 39(4):183-187, 1991. URL: https://doi.org/10.1016/0020-0190(91)90177-J.
  26. Nimrod Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30(4):852-865, 1983. URL: https://doi.org/10.1145/2157.322410.
  27. Haitao Wang and Jie Xue. Near-optimal algorithms for shortest paths in weighted unit-disk graphs. Discret. Comput. Geom., 64(4):1141-1166, 2020. URL: https://doi.org/10.1007/S00454-020-00219-7.
  28. Haitao Wang and Yiming Zhao. Improved algorithms for distance selection and related problems. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, volume 274 of LIPIcs, pages 101:1-101:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPICS.ESA.2023.101.
  29. Haitao Wang and Yiming Zhao. Reverse shortest path problem for unit-disk graphs. Journal of Computational Geometry, 14(1):14-47, 2023. Preliminary versions in WADS 2021 and WALCOMM 2022. URL: https://doi.org/10.20382/JOCG.V14I1A2.
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