An Optimal Solution to Room Search Problem

A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while making sure that no intruder escapes through the door during the search. Depending on where the door is placed, such a room may or may not be searchable. The two-guard search model is considered, where the two guards are required to be always mutually visible during a search. We present a simple characterization of searchable rooms under such a search model. In addition, we propose a linear algorithm to check a room's searchability.

• Type: Conference
• Year: 2006
• Where: CCCG
• Authors: Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda
• Keywords: CCCG 2006, CCCG 2007, Door, Rooms, Search Model