E-viri
-
Hoffmann, F.; Kaufmann, M.; Kriegel, K.
1991 Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991Conference Proceeding
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.< >
