Pages that link to "Item:Q699767"
From MaRDI portal
The following pages link to An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767):
Displaying 9 items.
- Approximating minimum bending energy path in a simple corridor (Q390148) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- The cost of bounded curvature (Q1947977) (← links)
- Convex tours of bounded curvature (Q1961381) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- Bounded-curvature shortest paths through a sequence of points using convex optimization (Q2840989) (← links)
- Approximating Minimum Bending Energy Path in a Simple Corridor (Q3060745) (← links)
- Self-approaching paths in simple polygons (Q4580095) (← links)
- Finding approximately convex ropes in the plane (Q6157950) (← links)