Abstract
We consider the problem of searching for mobile intruders in a polygonal region with one door by two guards. Given a simple polygon [Formula: see text] with a door d, which is called a room [Formula: see text], two guards start at d and walk along the boundary of [Formula: see text] 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 a characterization of the class of rooms searchable by two guards and an O(n log n)-time algorithm to test if a given room admits a walk, where n is the number of the vertices in [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Geometry & Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
