Searching a polygonal room with one door by a 1-searcher

International Journal of Computational Geometry and Applications

Volumn 10, Issue 2, 2000, Pages 201-220

  Lee, Jae Ha ^a,b   Park, Sang Min ^a   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Graph algorithm; Motion planning; Pursuit evasion; Visibility

Indexed keywords

EID: 0034390368     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000127     Document Type: Article

References (12)

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. Int. J. of Comp. Geom. and Appl., 5(4):397-412, 1995.
2. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear-time algorithm for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
3. L.J. Guibas, J.C. Latombe, S.M. Lavalle, D. Lin, and R. Motwani. A visibility-based pursuit-evasion problem. Int. J. of Comp. Geom. and Appl., 9(4-5):471-493, 1999.
4. P.J. Heffernan. An optimal algorithm for the two-guard problem. Int. J. of Comp. Geom. and Appl., 6(1):15-44, 1996.
5. C. Icking and R. Klein. The two guards problem. Int. J. of Comp. Geom. and Appl., 2(3):257-285, 1992.
6. J. H. Lee, S. Y. Shin, and K. Y. Chwa. Visibility-based pursuit-evasions in a polygonal room with a door. In Proc. 15rd ACM Symp. Comp. Geom., pages 281-290, 1999.
7. G. Narashimhan. On hamiltonian triangulations in simple polygon. In Proc. of Workshop on Algorithm and Data structure, 1997.
8. K. Sugihara, I. Suzuki, and M. Yamashita. The searchlight scheduling problem. SIAM J. Comput., 19(6):1024-1040, 1990.
9. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comput., 21(5):863-888, 1992.
10. I. Suzuki, M. Yamashita, H. Umemoto, and T. Kameda. Bushness and a tight worst-case upper bound on the search number of a simple polygon. Information Processing Letters, 66:49-52, 1998.
11. L.H. Tseng, P. Heffernan, and D.T. Lee. Two-guard walkability of simple polygons. Int. J. of Comp. Geom. and Appl., 8:85-116, 1998.
12. M. Yamashita, H. Umemoto, I. Suzuki, and T. Kameda. Searching for mobile intruders in a polygonal region by a group of mobile searchers. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 448-450, 1997.