Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
- Given an n-sided polygon, we present an O(n2 log n)-time algorithm for computing a shortest walk in which the total length of the paths that two guards traverse is minimized.
- Given an n-sided polygon, we present an O(n2)-time algorithm for computing a minimum diameter walk in which the maximum distance between two guards is minimized.
Finally we allow more than two guards. Here the guards should form a simple chain within the polygon such that any consecutive two guards along the chain are mutually visible and the first and last guard have to move along the boundary but others do not. - We present an O(n2)-time algorithm for computing the minimum number of guards to sweep an n-sided polygon and an O(n3)-time algorithm for computing such a schedule.
Unable to display preview. Download preview PDF.
- 1.B. Bhattacharya, A. Mukhopadhyay, and G. Narasimhan. Two-guard walkability of simple polygons. In Proc. of 7th WADS, 2001.Google Scholar
- 3.A. Efrat, L. Guibas, S. Har-Peled, D. Lin, J. Mitchell, and T. Murali. Sweeping simple polygons with a chain of guards. In Proc. of 16th Symp. on Discrete Algorithm, pages 927–936, 2000.Google Scholar
- 8.S. M. LaValle, B. H. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. In Proc. of 16th Symp. on Computational Geometry, 2000.Google Scholar
- 9.Jae-Ha Lee, Sang-Min Park, and Kyung-Yong Chwa. Searching a polygonal room with one door by a 1-searcher. Int. J. of Comp. Geom. and Appl., 10(2), 2000.Google Scholar
- 10.Jae-Ha Lee, Sung Yong Shin, and Kyung-Yong Chwa. Visibility-based pursuitevasion in a polygonal room with a door. In Proc. 15th ACM Sympos. on Computational Geometry, pages 281–290, 1999.Google Scholar
- 12.Sang-Min Park, Jae-Ha Lee, and Kyung-Yong Chwa. Visibility-based pursuitevasion in a polygonal region by a single searcher. In Proc. of ICALP, pages 456–468, 2001.Google Scholar