The following pages link to LR-visibility in polygons (Q676582):
Displaying 14 items.
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Walking in streets with minimal sensing (Q2355994) (← 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)
- Walking in Streets with Minimal Sensing (Q2867134) (← links)
- Simple Characterization of LR-visibility Polygons (Q3098084) (← 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)
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS (Q4949991) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- On hamiltonian triangulations in simple polygons (Extended Abstract) (Q5096949) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
