Pages that link to "Item:Q2706111"
From MaRDI portal
The following pages link to Approximating shortest paths on a nonconvex polyhedron (Q2706111):
Displaying 14 items.
- Approximate shortest path on a polyhedral surface and its applications (Q628041) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions (Q1283768) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- Shortest path on a non-convex polyhedron (Q1433539) (← links)
- Computing approximate shortest paths on convex polytopes (Q1601017) (← links)
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709) (← links)
- (Q2753947) (← links)
- On the shortest paths between two convex polyhedra (Q3798231) (← links)
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- (Q5208219) (← links)