论文信息 - Discrete Surveillance Tours in Polygonal Domains

Discrete Surveillance Tours in Polygonal Domains

The watchman route of a polygon is a closed tour that sees all points of the polygon. Computing the shortest such tour is a well-studied problem. Another reasonable optimization criterion is to req ...

Bengt J. Nilsson | Eli Packer | Elmar Langetepe

[1] Wei-Pand Chin,et al. Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..

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

[3] Moshe Dror,et al. Touring a sequence of polygons , 2003, STOC '03.

[4] Elmar Langetepe,et al. Inspecting a Set of Strips Optimally , 2009, WADS.

[5] Bengt J. Nilsson,et al. Weighted Discrete Surveillance Tours in Simple Polygons , 2017, EuroCG 2017.

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

[7] Xuehou Tan,et al. Fast computation of shortest watchman routes in simple polygons , 2001, Inf. Process. Lett..

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

[9] Simeon C. Ntafos,et al. Optimum watchman routes , 1986, SCG '86.