Searching a polygonal region from the boundary

International Journal of Computational Geometry and Applications

Volumn 11, Issue 5, 2001, Pages 529-553

  Suzuki, Ichiro ^a   Tazoe, Yuichi ^b   Yamashita, Masafumi ^b   Kameda, Tiko ^c  

^a University of Wisconsin Milwaukee   (United States)

^b KYUSHU UNIVERSITY   (Japan)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Polygonal region; Pursuit evasion; Search; Visibility

Indexed keywords

EID: 0035613136     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195901000638     Document Type: Article

References (17)

1. D. Crass, I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a corridor - The open edge variant of the polygon search problem," International Journal of Computational Geometry and Applications 5, 1995, pp. 397-412.
2. A. Efrat, L.J. Guibas, S. Har-Peled, D.C. Lin, J.S.B. Mitchell and T.M. Murali, "Sweeping simple polygons with a chain of guards," Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 927-936.
3. J.E. Goodman, J. Pach and C.K. Yap, Mountain climbing, ladder moving, and the ring-width of a polygon," Amer. Math. Monthly, 1989, pp. 494-510.
4. L.J. Guibas, J.-C. Latombe, S.M. LaValle, D. Lin and R. Motwani, "Visibility-based pursuit-evasion in a polygonal environment," in F. Dehne et al. Eds., WADS '97 Algorithms and Data Structures, (LNCS 1272, Springer), 1997, pp. 17-30.
5. P.J. Heffernan, "An optimal algorithm for the two-guard problem," International Journal of Computational Geometry and Applications 6, 1996, pp. 15-44.
6. C. Icking and R. Klein, "The two guards problem," International Journal of Computational Geometry and Applications 2, 1992, pp. 257-285.
7. S.M. LaValle and J.E. Hinrichsen, "Visibility-based pursuit-evasion: The case of curved environments," Proc. IEEE International Conference on Robotics and Automation, Detroit, Michigan, 1999, pp. 1677-1682.
8. S.M. LaValle, B.H. Simov and G. Slutzki, "An algorithm for searching a polygonal region with a flashlight," Proc. ACM Symposium on Computational Geometry, Hong Kong, 2000, pp. 260-269.
9. D.T. Lee and F.P. Preparata, "An optimal algorithm for finding the kernel of a polygon," Journal of the ACM 26, 1979, pp. 415-421.
10. J.H. Lee, S.-M. Park and K.-Y. Chwa, "Searching a polygonal room with a door by a 1-searcher," International J. of Computational Geometry and Applications 10, 2000, pp. 201-220.
11. J.H. Lee, S.Y. Shin and K.-Y. Chwa, "Visibility-based pursuit-evasion in a polygonal room with a door," Proc. ACM Symposium on Computational Geometry, Miami Beach, Florida, 1999, pp. 281-290.
12. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, Oxford, 1987.
13. K. Sugihara, I. Suzuki and M. Yamashita, "The searchlight scheduling problem," SIAM Journal on Computing 19, 6, 1990, pp. 1024-1040.
14. I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM Journal on Computing 21, 5, 1992, pp. 868-888.
15. I. Suzuki, M. Yamashita, H. Umemoto and T. Kameda, "Bushiness and a tight worst-case upper bound on the search number of a simple polygon," Information Processing Letters, Vol. 60, 1998, pp. 49-52.
16. L.H. Tseng, P. Heffernan and D.T. Lee, "Two-guard walkability of simple polygons," International Journal of Computational Geometry and Applications 8, 1998, pp. 85-116.
17. M. Yamashita, H. Umemoto, I. Suzuki and T. Kameda, "Searching for mobile intruders in a polygonal region by a group of mobile searchers," Algorithmica, to appear.