| S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Technical Report CS/TR-2001-161, KAIST, Dept. of Computer Science, Korea, January 2001. |
....deciding searchability of special classes of polygons, the general case single pursuer problem was open for quite a while. Recently, the authors provided a O(n ) solution for a single 1 searcher in a polygon [SSL00] a result which they later improved to O(n m log n m ) LSS00] Park et al. [PLC01] presented a polynomial solution for the case of a single 2 searcher and proved that adding more flashlights to a single pursuer does not increase the class of the polygons she can clear. Note that the set of polygons that can be cleared by a single 2 searcher is a proper subset of the set of ....
Sang-Min Park, Jae-Ha Lee, and Kyung-Yong Chwa. Visibility-based pursuitevasion in a polygonal region by a searcher. In F. Orejas, P. G. Spirakis, and J. Leeuwen, editors, Proceedings of 28th ICALP, volume 2076 of Lecture Notes in Computer Science, pages 456--468. Springer-Verlag, Berlin, 2001.
....each class of searchers. 1, 2, 3] presented polynomial solutions for deciding searchability of special classes of polygons, the general case single pursuer problem was open for quite a while. Recently, the authors provided a O(n ) solution for a single 1 searcher in a polygon [4] Park et al. [5] presented polynomial solutions for the cases of single 2 searcher and single # searcher. Independently of [1] Icking and Klein [7] defined the two guard walkability problem , which is a search problem for two guards who move on the boundary of a polygon while maintaining mutual visibility. ....
S.-M. Park, J.-H. Lee, and K.-Y. Chwa, "Visibilitybased pursuit-evasion in a polygonal region by a searcher," Tech. Rep. CS-TR-2001-161, KAIST, 2001.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Technical Report CS/TR-2001-161, KAIST, Dept. of Computer Science, Korea, January 2001.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa, \Visibilitybased pursuit-evasion in a polygonal region by a searcher," Tech. Rep. CS-TR-2001-161, KAIST, 2001.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa, "Visibility-based pursuitevasion in a polygonal region by a searcher," Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), vol. 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa, "Visibility-based pursuitevasion in a polygonal region by a searcher," Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), vol. 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibilitybased pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Col l oquium on Automata, Languages and Programming (ICALP), 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Technical Report CS/TR-2001-161, KAIST, Dept. of Computer Science, Korea, January 2001.
No context found.
S.-M. Park, J.-H. Lee and K.-Y. Chwa, "Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher", Automata, Languages and Programming, 2001, pp. 456-468.
No context found.
S-M. Park, J-H. Lee, and K-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibilitybased pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Col l oquium on Automata, Languages and Programming (ICALP), 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2076.
No context found.
S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Proceedings of the International Col l oquium on Automata, Languages and Programming (ICALP), 2076, 2001.
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