Pages that link to "Item:Q4323731"
From MaRDI portal
The following pages link to Shortest paths in the plane with polygonal obstacles (Q4323731):
Displaying 12 items.
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- An algorithm for finding the shortest sailing distance from any maritime navigable point to a designated port (Q1767073) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- (Q5111738) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
