2 search results - page 1 / 1 » Characterization of Polygons Searchable by a Boundary 1-Sear... |
CCCG
2006
13 years 6 months ago
2006
Suppose intruders are in a dark polygonal room and they can move at a finite but unbounded speed, trying to avoid detection. A boundary 1-searcher can move along the polygon bounda...
CCCG
2006
13 years 6 months ago
2006
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 maki...