Pages that link to "Item:Q4962186"
From MaRDI portal
The following pages link to Computing Shortest Paths among Curved Obstacles in the Plane (Q4962186):
Displaying 9 items.
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Minimizing Distance-to-Sight in Polygonal Domains (Q5091052) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- (Q5111738) (← links)
- Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468) (← links)
- Multi-robot motion planning for unit discs with revolving areas (Q6110072) (← links)
- Voronoi-based splinegon decomposition and shortest-path tree computation (Q6563938) (← links)
