Abstract
Here is an appealing problem which was raised by Victor Klee in 1973. Suppose the manager of a museum wants to make sure that at all times every point of the museum is watched by a guard. The guards are stationed at fixed posts, but they are able to turn around. How many guards are needed?
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
V. Chvátal: A combinatorial theorem in plane geometry, J. Combinatorial Theory, Ser. B 18 (1975), 39–41.
S. Fisk: A short proof of Chvátal’s watchman theorem, J. Combinatorial Theory, Ser. B 24 (1978), 374.
J. O’Rourke: Art Gallery Theorems and Algorithms, Oxford University Press 1987.
E. Schönhardt: Über die Zerlegung von Dreieckspolyedern in Tetraeder, Math. Annalen 98 (1928), 309–312.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2004). How to guard a museum. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05412-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-662-05412-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-05414-7
Online ISBN: 978-3-662-05412-3
eBook Packages: Springer Book Archive