A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras

A sliding camera travelling along a line segment s in a polygon P can see a point p in P if and only if p lies on a line segment contained in P that intersects s at a right angle. The objective of the minimum sliding cameras (MSC) problem is to guard P with the fewest sliding cameras possible, each of which is a horizontal or vertical line segment. In this paper, we give an \(O(n^3)\)-time 3-approximation algorithm for the MSC problem on any simple orthogonal polygon with n vertices. Our algorithm involves establishing a connection between the MSC problem and the problem of guarding simple grids with periscope guards.

[1]  Stephane Durocher,et al.  Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results , 2013, MFCS.

[2]  Simeon C. Ntafos,et al.  Covering Grids and Orthogonal Polygons with Periscope Guards , 1992, Comput. Geom..

[3]  Frank Hoffmann,et al.  On the Rectilinear Art Gallery Problem (Extended Abstract) , 1990, ICALP.

[4]  Stephan Eidenbenz,et al.  Inapproximability Results for Guarding Polygons without Holes , 1998, ISAAC.

[5]  Pawel Zylinski,et al.  An Efficient Algorithm for Mobile Guarded Guards in Simple Grids , 2006, ICCSA.

[6]  Matthew J. Katz,et al.  Guarding Orthogonal Art Galleries with Sliding Cameras , 2011, Int. J. Comput. Geom. Appl..

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

[8]  Stephan Johannes Eidenbenz,et al.  (In-)Approximability of visibility problems on polygons and terrains , 2000 .

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

[10]  Hans-Dietrich Hecker,et al.  Two NP-Hard Art-Gallery Problems for Ortho-Polygons , 1995, Math. Log. Q..

[11]  J. Mark Keil,et al.  Polygon Decomposition and the Orthogonal Art Gallery Problem , 2007, Int. J. Comput. Geom. Appl..

[12]  Pawel Zylinski,et al.  Cooperative mobile guards in grids , 2007, Comput. Geom..

[13]  Bengt J. Nilsson,et al.  Approximate Guarding of Monotone and Rectilinear Polygons , 2012, Algorithmica.

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

[15]  Subir Kumar Ghosh,et al.  Approximation algorithms for art gallery problems in polygons , 2010, Discret. Appl. Math..

[16]  Rajeev Motwani,et al.  Covering orthogonal polygons with star polygons: the perfect graph approach , 1988, SCG '88.

[17]  Stephane Durocher,et al.  A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras , 2013, IWOCA.

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