Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
Let P be an orthogonal polygon. Consider a sliding camera that travels back and forth along an orthogonal line segment s ⊆ P as its trajectory. The camera can see a point p ∈ P if there exists a point q ∈ s such that pq is a line segment normal to s that is completely contained in P. In the minimum-cardinality sliding cameras problem, the objective is to find a set S of sliding cameras of minimum cardinality to guard P (i.e., every point in P can be seen by some sliding camera in S) while in the minimum-length sliding cameras problem the goal is to find such a set S so as to minimize the total length of trajectories along which the cameras in S travel.
In this paper, we first settle the complexity of the minimum-length sliding cameras problem by showing that it is polynomial tractable even for orthogonal polygons with holes, answering a question posed by Katz and Morgenstern . Next we show that the minimum-cardinality sliding cameras problem is NP-hard when P is allowed to have holes, which partially answers another question posed by Katz and Morgenstern .
Unable to display preview. Download preview PDF.
- 8.Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)Google Scholar
- 14.Motwani, R., Raghunathan, A., Saran, H.: Covering orthogonal polygons with star polygons: the perfect graph approach. In: Proc. ACM SoCG, pp. 211–223 (1988)Google Scholar
- 15.O’Rourke, J.: Art gallery theorems and algorithms. Oxford University Press (1987)Google Scholar
- 17.Urrutia, J.: Art gallery and illumination problems. In: Handbook of Comp. Geom., pp. 973–1027. North-Holland (2000)Google Scholar