The following pages link to Minimal Sets of Visibility (Q5824043):
Displaying 4 items.
- Computing shortest transversals (Q757096) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Starshaped sets (Q2216442) (← links)
- Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)