Pages that link to "Item:Q4881404"
From MaRDI portal
The following pages link to Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon (Q4881404):
Displaying 6 items.
- LR-visibility in polygons (Q676582) (← links)
- Guarding in a simple polygon (Q1607056) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- Open Guard Edges and Edge Guards in Simple Polygons (Q4899264) (← links)
- Finding the shortest boundary guard of a simple polygon (Q5941506) (← links)
