Guarding Monotone Art Galleries with Sliding Cameras in Linear Time
A sliding camera in an orthogonal polygon \(P\) is a point guard \(g\) that travels back and forth along an orthogonal line segment \(s\) inside \(P\). A point \(p\) in \(P\) is guarded by \(g\) if and only if there exists a point \(q\) on \(s\) such that line segment \(pq\) is normal to \(s\) and contained in \(P\). In the minimum sliding cameras (MSC) problem, the objective is to guard \(P\) with the minimum number of sliding cameras. We give a linear-time dynamic programming algorithm for the MSC problem on \(x\)-monotone orthogonal polygons, improving the 2-approximation algorithm of Katz and Morgenstern (2011). More generally, our algorithm can be used to solve the MSC problem in linear time on simple orthogonal polygons \(P\) for which the dual graph induced by the vertical decomposition of \(P\) is a path. Our results provide the first polynomial-time exact algorithms for the MSC problem on a non-trivial subclass of orthogonal polygons.
- 2.Durocher, S., Filtser, O., Fraser, R., Mehrabi, A.D., Mehrabi, S.: A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 294–305. Springer, Heidelberg (2014)Google Scholar
- 7.King, J., Krohn, E.: Terrain guarding is NP-hard. In: SODA, pp. 1580–1593 (2010)Google Scholar
- 12.Seddighin, S.: Guarding polygons with sliding cameras. Master’s thesis, Sharif University of Technology (2014)Google Scholar