Skip to main content
SpringerLink
Log in

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon

  • Conference paper
  • First Online:
Approximation and Online Algorithms (WAOA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12806))

Included in the following conference series:

  • 382 Accesses

Abstract

The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time \(O(\log n)\)-approximation algorithm for placing as few guards as possible at vertices of a simple n-gon P, such that every point in P is visible to at least one of the guards. Ghosh also conjectured that this problem admits a polynomial-time algorithm with constant approximation ratio. Due to the centrality of guarding problems in the field of computational geometry, much effort has been invested throughout the years in trying to resolve this conjecture. Despite some progress (surveyed below), the conjecture remains unresolved to date. In this paper, we confirm the conjecture for the important case of weakly visible polygons, by presenting a \((2+{\varepsilon })\)-approximation algorithm for guarding such a polygon using vertex guards. A simple polygon P is weakly visible if it has an edge e, such that every point in P is visible from some point on e. We also present a \((2+{\varepsilon })\)-approximation algorithm for guarding a weakly visible polygon P, where guards may be placed anywhere on P’s boundary (except in the interior of the edge e). Finally, we present an O(1)-approximation algorithm for vertex guarding a polygon P that is weakly visible from a chord.

Our algorithms are based on an in-depth analysis of the geometric properties of the regions that remain unguarded after placing guards at the vertices to guard the polygon’s boundary. Finally, our algorithms may become useful as part of the grand attempt of Bhattacharya et al. to prove the original conjecture, as their approach is based on partitioning the underlying simple polygon into a hierarchy of weakly visible polygons.

O. Filtser was supported by the Eric and Wendy Schmidt Fund for Strategic Innovation, by the Council for Higher Education of Israel, and by Ben-Gurion University of the Negev. M. Katz was supported by grant 1884/16 from the Israel Science Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is \(\exists \)\(\mathbb{R}\)-complete. In: Proceedings of the 50th ACM SIGACT Sympos. on Theory of Computing, STOC, pp. 65–73 (2018)

    Google Scholar 

  2. Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. Ph.D. thesis, Johns Hopkins University (1984)

    Google Scholar 

  3. Ashur, S., Filtser, O., Katz, M.J., Saban, R.: Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms, WAOA, pp. 1–17 (2019)

    Google Scholar 

  4. Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput. 30(12), 910–914 (1981)

    Article  MathSciNet  Google Scholar 

  5. Bhattacharya, P., Ghosh, S.K., Pal, S.: Constant approximation algorithms for guarding simple polygons using vertex guards. arXiv:1712.05492 (2017)

  6. Bhattacharya, P., Ghosh, S.K., Roy, B.: Approximability of guarding weak visibility polygons. Discret. Appl. Math. 228, 109–129 (2017)

    Article  MathSciNet  Google Scholar 

  7. Bhattacharya, P., Ghosh, S.K., Roy, B.: Personal communication (2018)

    Google Scholar 

  8. Bonnet, É., Miltzow, T.: An approximation algorithm for the art gallery problem. In: Proceedings of the 33rd International Symposium on Computational Geometry, SoCG, pp. 20:1–20:15 (2017)

    Google Scholar 

  9. Das, G., Heffernan, P.J., Narasimhan, G.: Finding all weakly-visible chords of a polygon in linear time. Nord. J. Comput. 1(4), 433–457 (1994)

    MathSciNet  MATH  Google Scholar 

  10. Deshpande, A., Kim, T., Demaine, E.D., Sarma, S.E.: A pseudopolynomial time \(O(\log n)\)-approximation algorithm for art gallery problems. In: Algorithms and Data Structures, 10th International Workshop, WADS, pp. 163–174 (2007)

    Google Scholar 

  11. Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Inf. Process. Lett. 100(6), 238–245 (2006)

    Article  MathSciNet  Google Scholar 

  12. Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31(1), 79–113 (2001)

    Article  MathSciNet  Google Scholar 

  13. Friedrichs, S., Hemmer, M., King, J., Schmidt, C.: The continuous 1.5D terrain guarding problem: Discretization, Optimal solutions, and PTAS. JoCG 7(1), 256–284 (2016)

    Google Scholar 

  14. Ghosh, S.K.: Approximation algorithms for art gallery problems, pp. 429–434 (1997)

    Google Scholar 

  15. Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Discret. Appl. Math. 158(6), 718–722 (2010)

    Article  MathSciNet  Google Scholar 

  16. Ghosh, S.K., Maheshwari, A., Pal, S.P., Saluja, S., Veni Madhavan, C.E.: Characterizing and recognizing weak visibility polygons. Comput. Geom. 3, 213–233 (1993)

    Article  MathSciNet  Google Scholar 

  17. Gibson, M., Kanade, G., Krohn, E., Varadarajan, K.: Guarding terrains via local search. J. Comput. Geometry 5(1), 168–178 (2014)

    MathSciNet  MATH  Google Scholar 

  18. Joe, B., Simpson, R.B.: Corrections to Lee’s visibility polygon algorithm. BIT 27(4), 458–473 (1987)

    Article  Google Scholar 

  19. Katz, M.J.: A PTAS for vertex guarding weakly-visible polygons - an extended abstract. arXiv:1803.02160 (2018)

  20. Ke, Y.: Detecting the weak visibility of a simple polygon and related problems. Technical report, Johns Hopkins University (1987)

    Google Scholar 

  21. King, J., Kirkpatrick, D.G.: Improved approximation for guarding simple galleries from the perimeter. Discrete Comput. Geom. 46(2), 252–269 (2011)

    Article  MathSciNet  Google Scholar 

  22. Krohn, E., Nilsson, B.: Approximate guarding of monotone and rectilinear polygons. Algorithmica 66, 564–594 (2013)

    Article  MathSciNet  Google Scholar 

  23. Lee, D.T.: Visibility of a simple polygon. Comput. Vis. Graph. Image Process. 22(2), 207–221 (1983)

    Article  Google Scholar 

  24. Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32, 276–282 (1986)

    Article  MathSciNet  Google Scholar 

  25. Mustafa, N.H., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proceedings 25th Symposium on Computational Geometry, SoCG, pp. 17–22 (2009)

    Google Scholar 

  26. O’Rourke, J.: Art gallery theorems and algorithms. Oxford Univ. Press, Oxford (1987)

    MATH  Google Scholar 

  27. O’Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Trans. Info. Theory 29(2), 181–189 (1983)

    Article  MathSciNet  Google Scholar 

  28. Sack, J.-R., Suri, S.: An optimal algorithm for detecting weak visibility of a polygon (preliminary version). In: Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science, STACS, pp. 312–321 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ben-Gurion University of the Negev, Beersheba, Israel

    Stav Ashur

  2. Stony Brook University, Stony Brook, USA

    Omrit Filtser

  3. Ben-Gurion University of the Negev, Beersheba, Israel

    Matthew J. Katz

Authors
  1. Stav Ashur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Omrit Filtser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matthew J. Katz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthew J. Katz .

Editor information

Editors and Affiliations

  1. Computer Technology Institute, University of Patras, Patras, Greece

    Christos Kaklamanis

  2. Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel

    Asaf Levin

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ashur, S., Filtser, O., Katz, M.J. (2021). A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. In: Kaklamanis, C., Levin, A. (eds) Approximation and Online Algorithms. WAOA 2020. Lecture Notes in Computer Science(), vol 12806. Springer, Cham. https://doi.org/10.1007/978-3-030-80879-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-80879-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-80878-5

  • Online ISBN: 978-3-030-80879-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation