Pages that link to "Item:Q4818580"
From MaRDI portal
The following pages link to A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles (Q4818580):
Displaying 5 items.
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- The cost of bounded curvature (Q1947977) (← links)
- Census of bounded curvature paths (Q2290843) (← links)
- MINIMAL CURVATURE-CONSTRAINED PATHS IN THE PLANE WITH A CONSTRAINT ON ARCS WITH OPPOSITE ORIENTATIONS (Q3459365) (← links)
- SMOOTHING IMPRECISE 1.5D TERRAINS (Q4931729) (← links)