Generalized guarding and partitioning for rectilinear polygons

Computational Geometry: Theory and Applications

Volumn 6, Issue 1, 1996, Pages 21-44

  Györi, Ervin ^a   Hoffmann, Frank ^b   Kriegel, Klaus ^b   Shermer, Thomas ^c  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Polygon decomposition; Rectilinear polygons; Visibility

Indexed keywords

EID: 25544447664     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(96)00014-4     Document Type: Article

References (19)

1. A. Aggarwal, The art gallery theorem: Its variations, applications, and algorithmic aspects, PhD Thesis, The Johns Hopkins University, Baltimore, 1984.
2. I. Bjorling-Sachs and D. Souvaine, An efficient algorithm for guard placement in polygons with holes, Discrete Comp. Geometry 13(1) (1995) 77-110.
3. B. Chazelle, Triangulating simple polygons in linear time, Discrete Comp. Geometry 6(5) (1991) 485-523.
4. H. Edelsbrunner, J. O'Rourke and E. Welzl, Stationing guards in rectilinear art galleries, Comput. Vision, Graphics and Image Proc. 27 (1984) 167-176.
5. E. Györi, A short proof of the rectilinear art gallery theorem, SIAM J. Alg. Disc. Meth. 7 (1986) 452-454.
6. E. Györi, F. Hoffmann, K. Kriegel and T. Shermer, Generalized guarding and partitioning for rectilinear polygons, Technical Report B-93-17, Institut für Informatik, Freie Universität Berlin, December 1993.
7. F. Hoffmann, On the rectilinear art gallery problem, Proc. ICALP '90, LNCS 443 (1990) 717-728.
8. F. Hoffmann and M. Kaufmann, On the rectilinear art gallery problem - Algorithmic aspects, Proc. WG '90, LNCS 484 (1991) 239-250.
9. F. Hoffmann, M. Kaufmann and K. Kriegel, The art gallery theorem for polygons with holes, Proc. 32nd Symp. FOCS (1991) 39-48.
10. J. Kahn, M. Klawe and D. Kleitman, Traditional galleries require fewer watchmen, SIAM J. Alg. Disc. Meth. 4 (1983) 194-206.
11. J. Munro, M. Overmars and D. Wood, Variations on visibility, Proc. 3rd ACM Symp. Comp. Geom. (1987) 291-299.
12. B. Nilsson and S. Schuierer, An optimal algorithm for the rectilinear link center of a rectilinear polygon, Proc. WADS '91, LNCS 519 (1991) 249-260.
13. J. O'Rourke, An alternate proof of the rectilinear art gallery theorem, J. Geometry 21 (1983) 118-130.
14. J. O'Rourke, Art Gallery Theorems and Algorithms (Oxford University Press, 1987).
15. J.-R. Sack, Rectilinear computational geometry, Technical Report, Carleton University, SCS-TR-54, 1984.
16. T. Shermer, Recent results in art galleries, IEEE Proceedings 80(9) (1992) 1384-1399.
17. k-sets, Geometriae Dedicata 37 (1991) 183-203.
18. k-sets, Manuscript, Simon Fraser University, 1991.
19. W. Wessel, Personal communication, 1989.