Document Open Access Logo

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds

Authors Jack Spalding-Jamieson , Anurag Murty Naredla

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ESA.2025.90.pdf
  • Filesize: 1.12 MB
  • 18 pages
HTML5 Logo HTML (experimental)
LIPIcs.ESA.2025.90.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • obstacle separation
  • point separation
  • geometric intersection graph
  • Z₂-homology
  • fine-grained lower bounds

Metrics

Abstract

Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for a minimum-weight subset of the obstacles separating the two points. A few computational models for this problem have been previously studied. We give a unified approach to this problem in all models via a reduction to a particular shortest-path problem, and obtain improved running times in essentially all cases. In addition, we also give fine-grained lower bounds for many cases.

Cite As Get BibTex

Jack Spalding-Jamieson and Anurag Murty Naredla. Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 90:1-90:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.90

Author Details

Jack Spalding-Jamieson
  • Independent, Vancouver, Canada
Anurag Murty Naredla
  • University of Bonn, Germany

Acknowledgements

This work originated from a problem discussion group in the Fall of 2021, whose members collectively contributed to the discussion and development of some of this work’s preliminary results in the "arrangement model", as well as a better understanding of the problem as a whole. In addition to the authors, this group included (in alphabetical order) Sam Barr, Therese Biedl, Reza Bigdeli, Anna Lubiw, Jayson Lynch, Karthik Murali, and Graeme Stroud. In addition, we want to thank Jeff Erickson, Elizabeth Xiao, and Da Wei Zheng for helpful discussions about homology.

References

  1. Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, and Zoe Xi. All-pairs shortest paths with few weights per node. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, pages 1956-1964, 2025. URL: https://doi.org/10.1145/3717823.3718240.
  2. Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou. More asymmetry yields faster matrix multiplication. In Yossi Azar and Debmalya Panigrahi, editors, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025, pages 2005-2039. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.63.
  3. Sergio Cabello and Panos Giannopoulos. The complexity of separating points in the plane. Algorithmica, 74(2):643-663, 2016. URL: https://doi.org/10.1007/s00453-014-9965-6.
  4. Sergio Cabello and Lazar Milinković. Two optimization problems for unit disks. Comput. Geom., 70-71:1-12, 2018. URL: https://doi.org/10.1016/j.comgeo.2017.12.001.
  5. Erin W. Chambers, Jeff Erickson, Kyle Fox, and Amir Nayyeri. Minimum cuts in surface graphs. SIAM J. Comput., 52(1):156-195, 2023. URL: https://doi.org/10.1137/19M1291820.
  6. Timothy M. Chan. More algorithms for all-pairs shortest paths in weighted graphs. In David S. Johnson and Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pages 590-598. ACM, 2007. URL: https://doi.org/10.1145/1250790.1250877.
  7. Timothy M. Chan. More algorithms for all-pairs shortest paths in weighted graphs. SIAM J. Comput., 39(5):2075-2089, 2010. URL: https://doi.org/10.1137/08071990X.
  8. Timothy M Chan. Finding triangles and other small subgraphs in geometric intersection graphs. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1777-1805. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH68.
  9. Timothy M Chan and Dimitrios Skrepetos. All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. In 27th International Symposium on Algorithms and Computation (ISAAC 2016), pages 24-1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2016.24.
  10. Timothy M. Chan and Dimitrios Skrepetos. All-pairs shortest paths in geometric intersection graphs. J. Comput. Geom., 10(1):27-41, 2019. URL: https://doi.org/10.20382/JOCG.V10I1A2.
  11. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022. Google Scholar
  12. 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.
  13. Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, and Subhash Suri. A constant factor approximation for navigating through connected obstacles in the plane. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 822-839. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976465.52.
  14. Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira, and Frank Staals. Shortest Paths in Portalgons. In Erin W. Chambers and Joachim Gudmundsson, editors, 39th International Symposium on Computational Geometry (SoCG 2023), volume 258 of Leibniz International Proceedings in Informatics (LIPIcs), pages 48:1-48:16, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SoCG.2023.48.
  15. Tim Ophelders, Maarten Löffler, Rodrigo I Silveira, and Frank Staals. Shortest paths in portalgons. Journal of Computational Geometry, 15(2):174-221, 2024. Google Scholar
  16. Raimund Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci., 51(3):400-403, 1995. URL: https://doi.org/10.1006/JCSS.1995.1078.
  17. Jack Spalding-Jamieson and Anurag Murty Naredla. Separating two points with obstacles in the plane: Improved upper and lower bounds, 2025. URL: https://doi.org/10.48550/arXiv.2504.17289.
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