Abstract
We consider the problem of searching for mobile intruders in a polygonal region with one door by two guards. Given a simple polygon P with one door d, which is called a room (P, d), two guards start at d and walk along the boundary of P to detect a mobile intruder with a laser beam between the two guards. During the walk, two guards are required to be mutually visible all the time and eventually meet at one point. We give the characterization of the class of rooms searchable by two guards, which naturally leads to O(n log n)-time algorithm for testing the searchability of an n-sided room.
This work was supported by KOSEF(Korea Science and Engineering Foundation) under grant 98-0102-0701-3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Avis and G. T. Toussaint. An Optimal algorithm for determining the visibility of a polygon from an Edge, IEEE Transactions on Computers 30:910–914, 1981.
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 an Applications, 5(4):397–412, 1995.
L. J. 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.
L. J. Guibas, J.-C. Latombe, S. M. Lavalle, D. Lin and R. Motwani. A visibility-based pursuit-evasion problem, International Journal of Computational Geometry an Applications, 9(4):471–493, 1999.
P. J. Hedffernan. An optimal algorithm for the two-guard problem, International Journal of Computational Geometry an Applications, 6(1):15–44, 1996.
C. Icking and R. Klein. The two guards problem, International Journal of Computational Geometry an Applications, 2(3):257–285, 1992.
S. M. Lavalle, B. H. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. In Proceedings, ACM Symposium on Computational Geometry, pages 260–269, Hong Kong, June 2000.
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 an Applications, 10(2):201–220, 2000.
J.-H. Lee, S. Y. Shin and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal room with a door, In Proceedings, ACM Symposium on Computational Geometry, pages 281–290, FL, USA, June 1999.
G. Narashimhan. On hamiltonian triangulations in simple polygons, International Journal of Computational Geometry an Applications, 9(3):261–275, 1999.
I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region, SIAM Journal on Computing, 21(5):863–888, 1992.
L. H. Tseng, P. Heffernan, and D. T. Lee. Two-guard walkability of simple polygons, International Journal of Computational Geometry an Applications, 8:85–116, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, SM., Lee, JH., Chwa, KY. (2000). Characterization of Rooms Searchable by Two Guards. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-40996-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41255-7
Online ISBN: 978-3-540-40996-0
eBook Packages: Springer Book Archive