Jae-Ha Lee
- 1.W.P. Chin and S. Ntafos. Watchman routes in simple polygons. Disc. Comp. Geom., 6(1):9-31, 1991. Google Scholar
Digital Library
- 2.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.Google ScholarCross Ref
- 3.X. Deng, T. Kameda, and C. H. Papadimitriou. How to learn an unknown environment. In Proc. 32nd FOCS, pages 298- 303, 1994. Google ScholarDigital Library
- 4.L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygon. Algorithmica, 2:209-233, 1987.Google ScholarDigital Library
- 5.L. Guibas, J.-C. Latombe, S. Lavalle, D. Lin, and R. Motwani. A visibility-based pursuit-evasion problem. Int. J. of Comp. Geom. and Appl., 1998.Google Scholar
- 6.L. Guibas, J.C. Latombe, S.M. Lavalle, D. Lin, and R. Motwani. Finding an unpredictable target in a workspace with obstacles. In Proc. IEEE int. Conf. Robotics and Automation, 1997.Google Scholar
- 7.L. Guibas, J.C. Latombe, S.M. Lavalle, D. Lin, and R. Motwani. Visibility-based pursuit-evasion in a polygonal environment. in Proc. of the WADS, 1997. Google ScholarDigital Library
- 8.P.J. Heffernan. An optimal algorithm for the two-guard problem. in Proc. 9th ACM SCG, pages 348-358, 1993. Google ScholarDigital Library
- 9.F. Hoffmann, C. Icking, R. Klein, and K. Kriegel. A competitive strategy for learning a polygon. In Proc. 8th SODA, pages 166-174, 1997. Google ScholarDigital Library
- 10.C. Icking and R. Klein. The two guards problem. In Proc. 7th ACM SCG, pages 166-175, 1991. Google ScholarDigital Library
- 11.j.H. Lee, S.M. Park, and K.Y. Chwa. Searching a polygonal room by a 1-searcher. Manuscript, 1998.Google Scholar
- 12.J.H. Lee, S.Y. Shin, and K.Y. Chwa. Visibility-based pursuitevasion in a polygonal room with a door (full version of this paper), http ://jupiter.kaist.ac.kr/ jhlee/publications/paper.ps, 1998.Google Scholar
- 13.G. Narashirnhan. On hamiltonian triangulations in simple polygon. In Proc. Workshop on Algorithm and Data structure, 1997. Google ScholarDigital Library
- 14.S. Suri. Mimimum link paths in polygons and related problems. PhD thesis, Department of Computer Science, Johns Hopkins University, 1987. Google ScholarDigital Library
- 15.I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SlAM J. Comp., 21(5):863-888, 1992. Google ScholarDigital Library
- 16.I. Suzuki, M. Yamashita, H. Umemoto, and T. Kameda. Bushness and a fight worst-case upper bound on the search number of a simple polygon. IPL, 66:49-52, 1998. Google ScholarDigital Library
- 17.X. Tan and T. Hirata. Constructing shortest watchman routes 6,( by divide-and-conquer. In Proc. of 4th Int. Symp. Alg. and Comput. (ISAAC 93), pages 68-77, 1993. Google ScholarDigital Library
- 18.LH. Tseng, P. Heffernan, and D.T. Lee. Two-guard walkability of simple polygons. Int. J. of Comp. Geom. and Appl., 1998.Google ScholarCross Ref
- 19.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 ACM SCG, pages 448-450, 1997. Google ScholarDigital Library
Index Terms
- Visibility-based pursuit-evasion in a polygonal room with a door
Recommendations
Capture bounds for visibility-based pursuit evasion
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometryWe investigate the following problem in the visibility-based discrete-time model of pursuit evasion in the plane: how many pursuers are needed to capture an evader in a polygonal environment with obstacles under the minimalist assumption that pursuers ...
Visibility and ray shooting queries in polygonal domains
Given a polygonal domain (or polygon with holes) in the plane, we study the problem of computing the visibility polygon of any query point. As a special case of visibility problems, we also study the ray-shooting problem of finding the first point on ...
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
AbstractWe devise an algorithm for maintaining the visibility polygon of any query point in a dynamic polygonal domain, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, we update the data structures that ...
Comments