Guarding Polyominoes, Polycubes and Polyhypercubes

Abstract We consider variations of the original art gallery problem where the domain is a polyomino, a polycube, or a polyhypercube. An m-polyomino is the connected union of m unit squares called pixels, an m-polycube is the connected union of m unit cubes called voxels, and an m-polyhypercube is the connected union of m unit hypercubes in a d dimensional Euclidean space. In this paper we generalize and unify the known results about guarding polyominoes and polycubes and obtain simpler proofs. We also obtain new art gallery theorems for guarding polyhypercubes.

[1]  Jens Maßberg.  Perfect Graphs and Guarding Rectilinear Art Galleries , 2014, Discret. Comput. Geom..

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

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

[5]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[6]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[7]  J. Moon,et al.  Relations between packing and covering numbers of a tree , 1975 .

[8]  Val Pinciu.  Pixel Guards in Polyominoes , 2010, CTW.

[9]  Joseph S. B. Mitchell,et al.  The Art Gallery Theorem for Polyominoes , 2012, Discret. Comput. Geom..

[10]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

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