Guard Placement in Rectilinear Polygons

Guard placement problems have been extensively studied by mathematicians as well as computer scientists. The classical guard problem posed by Victor Klee is to determine the number of guards sufficient to see any art gallery given as an n -vertex simple polygon. Here we study traditional (or rectilinear) art-galleries, i.e. galleries in which all interior angles are either 270° or 90°. The Rectilinear Art Gallery Theorem originally proved by Kahn, Klawe and Kleitman states that any n-vertex rectilinear art gallery can always be guarded by at most [ n /4 J guards. Here we examine the problem from its computational point-of-view by providing an algorithmic proof of the Rectilinear Art Gallery Theorem. It is demonstrated that guard placement in monotone rectilinear polygons can be done in linear time, while the problem can be solved for arbitrary, nvertex, rectilinear polygons in 0 ( n loglog n ) time.

[1]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[2]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[3]  Franco P. Preparata,et al.  Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[4]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[5]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

[6]  Anna Lubiw,et al.  Decomposing polygonal regions into convex quadrilaterals , 1985, SCG '85.

[7]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[8]  J. Sack,et al.  Minimum Decompositions of Polygonal Objects , 1985 .

[9]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[10]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[11]  Ervin Györi.  A short proof of the rectilinear art gallery theorem , 1986 .

[12]  Alain Fournier,et al.  Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[13]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[14]  J. O'Rourke.  An alternate proof of the rectilinear art gallery theorem , 1983 .

[15]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..