[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 39-48

F. Hoffmann , Karl-Weierstrass-Inst. fur Math., Berlin, Germany

ABSTRACT

Art gallery problems which have been extensively studied over the last decade ask how to station a small (minimum) set of guards in a polygon such that every point of the polygon is watched by at least one guard. The graph-theoretic formulation and solution to the gallery problem for polygons in standard form is given. A complexity analysis is carried out, and open problems are discussed.

INDEX TERMS

open problems, art gallery theorem, polygons with holes, graph-theoretic formulation, complexity analysis

CITATION

K. Kriegel, F. Hoffmann and M. Kaufmann, "The art gallery theorem for polygons with holes,"

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS)*, San Juan, Puerto Rico, 1991, pp. 39-48.

doi:10.1109/SFCS.1991.185346

CITATIONS