Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain

Authors Matthew J. Katz , Rachel Saban, Micha Sharir



PDF
Thumbnail PDF

File

LIPIcs.ESA.2024.77.pdf
  • Filesize: 0.97 MB
  • 17 pages

Document Identifiers

Author Details

Matthew J. Katz
  • Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel
Rachel Saban
  • Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel
Micha Sharir
  • School of Computer Science, Tel Aviv University, Israel

Cite AsGet BibTex

Matthew J. Katz, Rachel Saban, and Micha Sharir. Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 77:1-77:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024.77

Abstract

We present several near-linear algorithms for problems involving visibility over a 1.5-dimensional terrain. Concretely, we have a 1.5-dimensional terrain T, i.e., a bounded x-monotone polygonal path in the plane, with n vertices, and a set P of m points that lie on or above T. The visibility graph VG(P,T) is the graph with P as its vertex set and {(p,q) | p and q are visible to each other} as its edge set. We present algorithms that perform BFS and DFS on VG(P,T), which run in O(nlog n + mlog³(m+n)) time. We also consider three optimization problems, in which P is a set of points on T, and we erect a vertical tower of height h at each p ∈ P. In the first problem, called the reverse shortest path problem, we are given two points s, t ∈ P, and an integer k, and wish to find the smallest height h^* for which VG(P(h^*),T) contains a path from s to t of at most k edges, where P(h^*) is the set of the tips of the towers of height h^* erected at the points of P. In the second problem we wish to find the smallest height h^* for which VG(P(h^*),T) contains a cycle, and in the third problem we wish to find the smallest height h^* for which VG(P(h^*),T) is nonempty; we refer to that problem as "Seeing the most without being seen". We present algorithms for the first two problems that run in O^*((m+n)^{6/5}) time, where the O^*(⋅) notation hides subpolynomial factors. The third problem can be solved by a faster algorithm, which runs in O((n+m)log³ (m+n)) time.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • 1.5-dimensional terrain
  • visibility
  • visibility graph
  • reverse shortest path
  • parametric search
  • shrink-and-bifurcate
  • range searching

Metrics

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

References

  1. P. K. Agarwal, N. Alon, B. Aronov, and S. Suri. Can visibility graphs be represented compactly? Discrete Comput. Geom., 12:347-365, 1994. Google Scholar
  2. P. K. Agarwal, S. Bereg, O. Daescu, H. Kaplan, S. C. Ntafos, M. Sharir, and B. Zhu. Guarding a terrain by two watchtowers. Algorithmica, 58:352-390, 2010. Google Scholar
  3. P. K. Agarwal, M. J. Katz, and M. Sharir. On reverse shortest paths in geometric proximity graphs. Comput. Geom., 117:102053, 2024. Google Scholar
  4. P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Algorithmica, 13(4):325-345, 1995. Google Scholar
  5. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3(1):1-19, 1983. Google Scholar
  6. R. Ben Avraham, O. Filtser, H. Kaplan, M. J. Katz, and M. Sharir. The discrete and semicontinuous Fréchet distance with shortcuts via approximate distance counting and selection. ACM Trans. Algorithms, 11, 2015, Art. 29. Google Scholar
  7. B. Ben-Moshe, O. A. Hall-Holt, M. J. Katz, and J. S. B. Mitchell. Computing the visibility graph of points within a polygon. In Proc. Sympos. on Computational Geometry (SoCG), pages 27-35, 2004. Google Scholar
  8. B. Ben-Moshe, M. J. Katz, and J. S. B. Mitchell. A constant-factor approximation algorithm for optimal 1.5D terrain guarding. SIAM J. Comput., 36:1631-1647, 2007. Google Scholar
  9. G. S. Brodal and R. Jacob. Dynamic planar convex hull with optimal query time. In Proc. 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 57-70. Springer, 2000. See also arXiv:1902.11169. Google Scholar
  10. S. Cabello and M. Jejčič. Shortest paths in intersection graphs of unit disks. Comput. Geom. Theory Appls., 48:360-367, 2015. Google Scholar
  11. T. M. Chan and D. Skrepetos. All-pairs shortest paths in unit disk graphs in slightly subquadratic time. In Proc. 27th Int. Sympos on Algorithms and Computation (ISAAC), pages 24:1-24:13, 2016. Google Scholar
  12. B. Chazelle and L. Guibas. Fractional cascading: I. a data structuring technique. Algorithmica, 1:133-162, 1986. Google Scholar
  13. S. Friedrichs, M. Hemmer, J. King, and C. Schmidt. The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS. J. Comput. Geom., 7:256-284, 2016. Google Scholar
  14. M. Gibson, G. Kanade, E. Krohn, and K. R. Varadarajan. Guarding terrains via local search. J. Comput. Geom., 5:168-178, 2014. Google Scholar
  15. J. Hershberger. An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica, 4:141-155, 1989. Google Scholar
  16. H. Kaplan, M. J. Katz, R. Saban, and M. Sharir. The unweighted and weighted reverse shortest path problem for disk graphs. In Proc. 31st European Symposium on Algorithms, pages 67:1-67:14, 2023. Also in arXiv:2307.14663. Google Scholar
  17. H. Kaplan, W. Mulzer, L. Roditty, P. Seiferth, and M. Sharir. Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. Discrete Comput. Geom., 64:838-904, 2020. Google Scholar
  18. M. J. Katz and M. Sharir. Efficient algorithms for optimization problems involving distances in a point set. In arXiv:2111.02052. Google Scholar
  19. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23(2):166-204, 1981. Google Scholar
  20. M. Pocchiola and G. Vegter. Computing the visibility graph via pseudo-triangulations. In Proc. 11th Sympos. on Computational Geometry (SoCG), pages 248-257, 1995. Google Scholar
  21. K. R. Varadarajan. Approximating monotone polygonal curves using the uniform metric. In Proc. 12th Sympos. on Computational Geometry (SoCG), pages 311-318, 1996. Google Scholar
  22. H. Wang and J. Xue. Near-optimal algorithms for shortest paths in weighted unit-disk graphs. Discrete Comput. Geom., 64:1141-1166, 2020. Google Scholar
  23. H. Wang and Y. Zhao. Reverse shortest path problem for unit-disk graphs. In Proc. 17th Algorithms and Data Structures Sympos. (WADS), pages 655-668, 2021. Also in arXiv:2104.14476. Google Scholar
  24. H. Wang and Y. Zhao. Reverse shortest path problem in weighted unit-disk graphs. In Proc. 16th Internat. Conf. on Algorithms and Computation (WALCOM), volume 13174 of Lecture Notes in Computer Science, pages 135-146. Springer, 2022. 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