Jae-Ha Lee, Sang-Min Park, and Kyung-Yong Chwa. Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications, 10(2):201--220, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Characterization of the Class of Polygons Searchable by a.. - Park, Lee, Chwa (2000) Self-citation (Park Chwa) (Correct)
....for testing the 1 searchability of a given polygon. As a characterizable variant of the polygon, many researchers considered rooms and corridors. A room is a polygonal region having one door and the searcher should detect the intruder while not allowing the intruder to reach the door. Lee et al. [6] characterized the class of 1 searchable rooms and presented an O(n 2 ) time algorithm for constructing a search schedule and an O(n log n) time algorithm for testing the 1 searchability. This characterization was extended into the case of a searcher with 360 visibility [7] A corridor is a ....
....at t. In this paper, we assume that P contains (t) t) and boundary points of P are allowed to lie in the middle of (t) t) see Figure 1) 1 q p Figure 1: The 1 searcher can see p and q simultaneously. 1 This assumption is slightly different from that in [4] We follow the definition in [6], because this definition is consistent with the case of the searcher with 360 visibility. 3 The polygon P is 1 searchable if it admits a search schedule ( satisfying that for every continuous function : 0; 1) P , there exists a time t 2 [0; 1) such that (t) 2 (t) t) This implies ....
[Article contains additional citation context not shown here]
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):201--220, 2000.
Visibility-Based Pursuit-Evasion in a Polygonal Region by a.. - Park, Lee, Chwa (2001) (15 citations) Self-citation (Park Chwa) (Correct)
.... the searchers and the intruder can move from vertex to vertex until a searcher and the intruder eventually lie in one vertex [11, 13] After adopting geometric free space constraints and visibility of the searchers, this problem has attracted much attention in computational geometry and robotics [1, 3 6, 8, 10, 15, 16, 18]. As the first attempt, Suzuki and Yamashita [15] introduced the polygon search problem, which is the topic of this paper. They presented some necessary or su#cient conditions for a polygon to be searchable by a single searcher but no complete characterizations. Guibas et al. 3] presented a ....
J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Searching a polygonal room with one door by a 1-searcher. Int. J. of Comp. Geom. and Appl., 10(2):201--220, 2000.
On the Polygon-Search Conjecture - Lee, Park, Chwa (2000) Self-citation (Park Chwa) (Correct)
....main open problem raised in [9] is to find a simple characterization (or an efficient algorithm to compute a search schedule) of # searchable polygons. In spite of many researches, complete characterizations or efficient algorithms are known only for special cases of the polygon search problem [3, 1, 2, 5, 7]. Recently, LaValle et al. 4] presented an O(n 2 ) time complete algorithm for constructing a search schedule of the 1 searcher. Lee et al. 6] presented an O(n 2 ) time algorithm to find a search schedule of the 2 searcher. However, the characterization of the class of # searchable ....
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):201--220, 2000.
Algorithms for Distributed and Mobile Sensing - Isler (2004) (Correct)
No context found.
Jae-Ha Lee, Sang-Min Park, and Kyung-Yong Chwa. Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications, 10(2):201--220, 2000.
Hybrid Control for Visibility-Based Pursuit-Evasion Games - Isler, Belta, al. (Correct)
No context found.
J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications, 10(2):201--220, 2000.
Locating and Capturing an Evader in a Polygonal Environment - Isler, Kannan, Khanna (2004) (Correct)
No context found.
J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications, 10(2):201--220, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC