Pages that link to "Item:Q5931367"
From MaRDI portal
The following pages link to Characterizing LR-visibility polygons and related problems (Q5931367):
Displaying 7 items.
- Searching for mobile intruders in circular corridors by two 1-searchers (Q643019) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
- Characterizing and recognizing LR-visibility polygons (Q2448917) (← links)
- A unified and efficient solution to the room search problem (Q2479474) (← 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)
