Pages that link to "Item:Q1085615"
From MaRDI portal
The following pages link to Shortest paths in the plane with convex polygonal obstacles (Q1085615):
Displaying 15 items.
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- k-th shortest collision-free path planning (Q1092820) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Time and space efficient algorithms for shortest paths between convex polygons (Q1098634) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- An exact geometry-based algorithm for path planning (Q1797878) (← links)
- Minimal tangent visibility graphs (Q1924714) (← links)
- 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)
- Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← links)
- (Q5111738) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- Linear approximation of simple objects (Q5906528) (← links)
