Art gallery problems for convex nested polygons

INFORMS Journal on Computing

Volumn 9, Issue 1, 1997, Pages 100-110

  Bhadury, J ^a   Chandru, V ^a   Maheshwari, A ^a   Chandrasekaran, R ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Art gallery problems; Computational geometry; Convex polygons

Indexed keywords

EID: 20044394043     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.9.1.100     Document Type: Article

References (4)

1. A. AGGARWAL, 1984. The Art Gallery Theorem: Its Variations, Applications and Algorithmic Aspects, Ph.D. Thesis, Johns Hopkins University.
2. A. AGGARWAL, H. BOOTH, J. O'ROURKE, S. SURI, and C.K. YAP, 1989. Finding Minimal Convex Nested Polygons, Information and Computation 83, 98-110.
3. M.J. ATALLAH and M.T. GOODRICH, 1986. Efficient Parallel Solutions to Some Geometric Problems, Journal of Parallel and Distributed Processing 3, 492-507.
4. J.J. BARTHOLDI III, J.B. ORLIN, and H.D. RATLIFF, 1980. Cyclic Scheduling Via Integer Programming with Circular Ones, Operations Research 28, 1074-1085.