Pages that link to "Item:Q4513233"
From MaRDI portal
The following pages link to COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233):
Displaying 4 items.
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762) (← links)
- Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)