Abstract
The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon P, is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard P were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for vertex guards and edge guards that achieved a ratio of \(\mathcal{O}(\log n)\), which was improved upto \(\mathcal{O}(\log\log OPT)\) by King and Kirkpatrick in 2011. It has been conjectured that constant-factor approximation algorithms exist for these problems. We settle the conjecture for the special class of polygons that are weakly visible from an edge and contain no holes by presenting a 6-approximation algorithm for finding the minimum number of vertex guards that runs in \(\mathcal{O}(n^2)\) time. On the other hand, for weak visibility polygons with holes, we present a reduction from the Set Cover problem to show that there cannot exist a polynomial time algorithm for the vertex guard problem with an approximation ratio better than \(((1−\epsilon)/12)\ln n\) for any ε > 0, unless NP = P.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. PhD thesis, The Johns Hopkins University, Baltimore, MD (1984)
Avis, D., Toussaint, G.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Transactions on Computers 30, 910–914 (1981)
Bhattacharya, P., Ghosh, S.K., Roy, B.: Vertex guarding in weak visibility polygons. CoRR, abs/1409.4621 (2014)
Chvatal, V.: A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B 18(1), 39–41 (1975)
Deshpande, A., Kim, T.-J., Demaine, E.D., Sarma, S.E.: A pseudopolynomial time o(logn)-approximation algorithm for art gallery problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 163–174. Springer, Heidelberg (2007)
Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Information Processing Letters 100(6), 238–245 (2006)
Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability of some art gallery problems. In: Canadian Conference on Computational Geometry, pp. 1–11 (1998)
Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31(1), 79–113 (2001)
Fisk, S.: A short proof of Chvátal’s watchman theorem. Journal of Combinatorial Theory, Series B 24(3), 374 (1978)
Ghosh, S.K.: Approximation algorithms for art gallery problems. In: Proc. of Canadian Information Processing Society Congress, pp. 429–434 (1987)
Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press (2007)
Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons. Discrete Applied Mathematics 158(6), 718–722 (2010)
Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons and terrains. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 21–34. Springer, Heidelberg (2010)
Ghosh, S.K., Maheshwari, A., Pal, S., Saluja, S., Veni Madhavan, C.E.: Characterizing and recognizing weak visibility polygons. Computational Geometry 3(4), 213–233 (1993)
Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209–233 (1987)
Katz, M.J., Roisman, G.S.: On guarding the vertices of rectilinear domains. Computational Geometry 39(3), 219–228 (2008)
King, J., Kirkpatrick, D.G.: Improved approximation for guarding simple galleries from the perimeter. Discrete & Computational Geometry 46(2), 252–269 (2011)
Lee, D.T., Lin, A.: Computational complexity of art gallery problems. IEEE Transactions on Information Theory 32(2), 276–282 (1986)
O’Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Transactions on Information Theory 29(2), 181–189 (1983)
Schuchardt, D., Hecker, H.-D.: Two NP-Hard Art-Gallery Problems for Ortho-Polygons. Mathematical Logic Quarterly 41, 261–267 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bhattacharya, P., Ghosh, S.K., Roy, B. (2015). Vertex Guarding in Weak Visibility Polygons. In: Ganguly, S., Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer, Cham. https://doi.org/10.1007/978-3-319-14974-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-14974-5_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14973-8
Online ISBN: 978-3-319-14974-5
eBook Packages: Computer ScienceComputer Science (R0)