Abstract
In 1973, Victor Klee posed the following question: How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls?
This wonderfully naïve question of combinatorial geometry has, since its formulation, stimulated a plethora of fun papers, surveys and a book, most of them written in the last twentyfive years. Several variations of the original Art Gallery Problem have appeared, and continue to appear in the literature. In this talk, we will present some recent work motivated by the following problem.
Experience dictates that while trying to locate the best location for a wireless within a building, the main factor that attenuates the signal of a wireless modem, is the number of walls that a signal has to cross. Thus we call a wireless modem (from now on a modem) a k-modem if the signal it transmits is capable of crossing k-walls of a building, and still provide a strong enough signal.
A generalization of Klee’s question is thus: How many k-modems are necessary, and how many are sufficient to cover the interior of an art gallery with n-walls? For k = 0, our problem reduces to the original Art Gallery Problem.
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 subscriptionsReferences
Aichholzer, O., Aurenhammer, F., Demaine, E.D., Hurtado, F., Ramos, P., Urrutia, J.: On k-convex polygons. Computational Geometry 45(3), 73–87 (2012)
Aichholzer, O., Aurenhammer, F., Hackl, T., Hurtado, F., Pilz, A., Ramos, P., Urrutia, J., Valtr, P., Vogtenhuber, B.: On k-convex point sets (in preparation)
Fabila-Monroy, R., Ruiz-Vargas, A., Urrutia, J.: On Modem Illumination Problems. In: Proc. XIV Encuentros de Geometra Computacional, Zaragoza, Spain, pp. 9–19 (June 2009)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press (1987)
Urrutia, J.: Art Gallery and Illumination Problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook on Computational Geometry, pp. 973–1026. North Holland (Elsevier Science Publisheres) (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urrutia, J. (2012). Art Galleries, k-modems, and k-convexity. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-30347-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30346-3
Online ISBN: 978-3-642-30347-0
eBook Packages: Computer ScienceComputer Science (R0)