论文信息 - The 3-dimensional searchlight scheduling problem

The 3-dimensional searchlight scheduling problem

The problem of searching for a mobile intruder in a polygonal region by a set of stationary guards, each carrying an orientable laser, is known in the literature as the Searchlight Scheduling Problem. A long-standing conjecture concerns the NP-hardness of deciding if a given polygon is searchable by a given set of guards. In this paper we introduce the more general problem of detecting an intruder in a 3-dimensional polyhedral region by a set of searchplanes within a given time, and we prove its NP-hardness.

Giovanni Viglietta | Maurizio Monge | G. Viglietta | M. Monge

[1] Bernard Chazelle,et al. Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

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

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

[4] Francesco Bullo,et al. A Complete Algorithm for Searchlight Scheduling , 2011, Int. J. Comput. Geom. Appl..

[5] Masafumi Yamashita,et al. The Searchlight Scheduling Problem , 1990, SIAM J. Comput..

[6] Masafumi Yamashita,et al. Searching a polygonal region by a group of stationary k-searchers , 2004, Inf. Process. Lett..

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