Pages that link to "Item:Q4818547"
From MaRDI portal
The following pages link to AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT (Q4818547):
Displaying 11 items.
- An alternative proof for the equivalence of searcher and 2-searcher (Q284588) (← links)
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- Sweeping simple polygons with the minimum number of chain guards (Q845964) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Minimization of the maximum distance between the two guards patrolling a polygonal region (Q2445875) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← links)
- Hide-and-Seek: Algorithms for Polygon Walk Problems (Q3010428) (← links)
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Q3502674) (← links)
- FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE (Q3562853) (← links)
- Visibility-Based Pursuit-Evasion with Bounded Speed (Q3564333) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)
