The following pages link to LR-visibility in polygons (Q676582):
Displayed 7 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)
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← 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)
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS (Q4949991) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)