Abstract
In the art gallery problem the goal is to place guards (as few as possible) in a polygon so that a maximal area of the polygon is covered. We address here a closely related problem: how to place paintings and guards in an art gallery so that the total value of guarded paintings is a maximum. More formally, a simple polygon is given along with a set of paintings. Each painting, has a length and a value. We study how to place at the same time: i) a given number of guards on the boundary of the polygon and ii) paintings on the boundary of the polygon so that the total value of guarded paintings is maximum. We investigate this problem for a number of cases depending on: i) where the guards can be placed (vertices, edges), ii) whether the polygon has holes or not and iii) whether the goal is to oversee the placed paintings (every point of a painting is seen by at least one guard), or to watch the placed paintings (at least one point of a painting is seen by at least one guard). We prove that the problem is NP-hard in all the above cases and we present polynomial time approximation algorithms for all cases, achieving constant ratios.
Christodoulos Fragoudakis and Euripides Markou wish to acknowledge partial support by PYTHAGORAS, project 70/3/7392 under the EPEAEK program of the Greek Ministry of Educational and Religious Affairs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lee, D., Lin, A.: Computational complexity of art gallery problems. IEEE Trans. Inform.Theory 32, 276–282 (1986)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, New York (1987)
Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming A 62, 461–474 (1993)
Shermer, T.: Recent results in Art Galleries. Proc. of the IEEE (1992)
Urrutia, J.: Art gallery and Illumination Problems. Handbook on Computational Geometry (1998)
Eidenbenz, S.: (In-)Approximability of Visibility Problems on Polygons and Terrains, PhD Thesis, ETH Zurich (2000)
Eidenbenz, S.: Inapproximability Results for Guarding Polygons without Holes. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 427–436. Springer, Heidelberg (1998)
Ghosh, S.: Approximation algorithms for Art Gallery Problems. In: Proc. of the Canadian Information Processing Society Congress, pp. 429–434 (1987)
Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1996)
Hochbaum, D.: Approximating Covering and Packing Problems. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 94–143. PWS Publishing Company (1996)
Avis, D., Rappaport, D.: Computing the largest empty convex subset of a set of points. In: Proc. 1st Ann. ACM Symposium Computational Geometry, pp. 161–167 (1985)
Dobkin, D., Edelsbrunner, H., Overmars, H.: Searching for Empty Convex Polygons. Algorithmica 5, 561–571 (1990)
Edelsbrunner, H., Guibas, L.: Topologically sweeping an arrangement. J. Comput. System Sci. 38, 165–194 (1989)
Chekuri, C., Khanna, S.: A PTAS for the Multiple Knapsack problem. In: Proc. 11th ACM Symp on Discrete Algorithms, pp. 213–222 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fragoudakis, C., Markou, E., Zachos, S. (2005). How to Place Efficiently Guards and Paintings in an Art Gallery. In: Bozanis, P., Houstis, E.N. (eds) Advances in Informatics. PCI 2005. Lecture Notes in Computer Science, vol 3746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573036_14
Download citation
DOI: https://doi.org/10.1007/11573036_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29673-7
Online ISBN: 978-3-540-32091-3
eBook Packages: Computer ScienceComputer Science (R0)