Pages that link to "Item:Q1175781"
From MaRDI portal
The following pages link to Computing external farthest neighbors for a simple polygon (Q1175781):
Displaying 7 items.
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Guarding Exterior Region of a Simple Polygon (Q5452157) (← links)