Abstract
It is shown that [n/4] point guards are always sufficient and sometimes necessary to watch a rectilinear polygon with an arbitrary number of holes, where n is the total number of vertices.
(Extended Abstract)
Part of the research work was done while visiting the Mathematical Institute Budapest of the Hungarian Academy of Sciences and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University.
Preview
Unable to display preview. Download preview PDF.
References
E. Györi, A short proof of the rectilinear art gallery theorem, SIAM J. Alg. Disc. Math. 7 (1986), 452–454
F. Hoffmann, On the rectilinear art gallery problem, Technical Report 89-5, DIMACS Center, Rutgers University
F. Hoffmann, M. Kaufmann, On the rectilinear art gallery — algorithmic aspects, draft, March 1990
F. Hoffmann, K. Kriegel, Embedding rectilinear graphs in linear time, IPL 29 (1988), 75–79
J. Kahn, M. Klawe, D. Kleitmann, Traditional galleries require fewer watchmen, SIAM J. Alg. Disc. Math. 4 (1983), 194–206
R. Motwani, A Raghunathan, H. Saran, Covering orthogonal polygons with star polygons: The perfect graph approach, Proc. 4th ACM Symp. on Comp. Geometry 1988, 211–223
S. Ntafos, On gallery watchmen in grids, IPL 23 (1986), 99–102
J. O'Rourke, An alternate proof of the rectilinear art gallery theorem, J. on Geometry 21 (1983), 118–130
J. O'Rourke, Art gallery theorems and algorithms, Oxford Univ. Press. New York, 1987
W. Wessel, personal communication, 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, F. (1990). On the rectilinear art gallery problem. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032069
Download citation
DOI: https://doi.org/10.1007/BFb0032069
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive