Abstract
In this paper, we give a O(logc opt )-approximation algorithm for the point guard problem where c opt is the optimal number of guards. Our algorithm runs in time polynomial in n, the number of walls of the art gallery and the spread Δ, which is defined as the ratio between the longest and shortest pairwise distances. Our algorithm is pseudopolynomial in the sense that it is polynomial in the spread Δ as opposed to polylogarithmic in the spread Δ, which could be exponential in the number of bits required to represent the vertex positions. The special subdivision procedure in our algorithm finds a finite set of potential guard-locations such that the optimal solution to the art gallery problem where guards are restricted to this set is at most 3c opt . We use a set cover cum VC-dimension based algorithm to solve this restricted problem approximately.
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
Bose, P., Lubiw, A., Munro, J.I.: Efficient visibility queries in simple polygons. In: Proc. 4th Canad. Conf. Comput. Geom., pp. 23–28 (1992)
Guibas, L.J., Motwani, R., Raghavan, P.: The robot localization problem. SIAM J. Comput. 26(4), 1120–1138 (1997)
González-Banos, H., Latombe, J.: A randomized art-gallery algorithm for sensor placement. In: Proc. 17th Symp. Comput. Goem, pp. 232–240 (2001)
Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31, 79–113 (2001)
Ghosh, S.: Approximation algorithm for art gallery problems. In: Canad. Information Processing Soc. Congress (1987)
Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. In: Proc. 10th Symp. Comp. Geom., pp. 293–302 (1994)
Urrutia, J.: Art Gallery and Illumination Problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry (2000)
O’Rourke, J.: Art Gallery Theorems and Algorithms (1987)
Shermer, T.: Recent results in art galleries. Proc. IEEE 80, 1384–1399 (1992)
Chvátal, V.: A combinatorial theorem in plane geometry. J. Combinat. Theory B 18, 39–41 (1975)
Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Info. Theory IT-32, 276–282 (1986)
Brodén, B., Hammar, M., Nilsson, B.J.: Guarding lines and 2-link polygons is APX-hard. In: Proc. 13th Canad. Conf. Comp. Geom., pp. 45–48 (2001)
Erickson, J.: Nice point sets can have nasty Delaunay triangulations. In: Proc. 17th Symp. Comp. Geom., pp. 96–105 (2001)
Erickson, J.: Dense point sets have sparse Delaunay triangulations: or “...but not too nasty”. In: Proc. 13th Symp. Disc. Algo., pp. 125–134 (2002)
Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Info. Proc. Lett. 100(6), 238–245 (2006)
Valtr, P.: Guarding galleries where no point sees a small area. Israel J. Math. 104, 1–16 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deshpande, A., Kim, T., Demaine, E.D., Sarma, S.E. (2007). A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)