On the rectilinear art gallery problem
Part of the Lecture Notes in Computer Science book series (LNCS, volume 443)
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.
Unable to display preview. Download preview PDF.
- E. Györi, A short proof of the rectilinear art gallery theorem, SIAM J. Alg. Disc. Math. 7 (1986), 452–454Google Scholar
- F. Hoffmann, On the rectilinear art gallery problem, Technical Report 89-5, DIMACS Center, Rutgers UniversityGoogle Scholar
- F. Hoffmann, M. Kaufmann, On the rectilinear art gallery — algorithmic aspects, draft, March 1990Google Scholar
- F. Hoffmann, K. Kriegel, Embedding rectilinear graphs in linear time, IPL 29 (1988), 75–79Google Scholar
- J. Kahn, M. Klawe, D. Kleitmann, Traditional galleries require fewer watchmen, SIAM J. Alg. Disc. Math. 4 (1983), 194–206Google Scholar
- 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–223Google Scholar
- S. Ntafos, On gallery watchmen in grids, IPL 23 (1986), 99–102Google Scholar
- J. O'Rourke, An alternate proof of the rectilinear art gallery theorem, J. on Geometry 21 (1983), 118–130Google Scholar
- J. O'Rourke, Art gallery theorems and algorithms, Oxford Univ. Press. New York, 1987Google Scholar
- W. Wessel, personal communication, 1989Google Scholar
© Springer-Verlag Berlin Heidelberg 1990