Pages that link to "Item:Q1388131"
From MaRDI portal
The following pages link to Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131):
Displaying 15 items.
- Approximation algorithms for cutting a convex polyhedron out of a sphere (Q388101) (← links)
- Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
- Approximate shortest path on a polyhedral surface and its applications (Q628041) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← 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)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Computing approximate shortest paths on convex polytopes (Q1601017) (← links)
- On the upper bound on the average distance from the Fermat-Weber center of a convex body (Q2230395) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Approximating shortest paths on a nonconvex polyhedron (Q2706111) (← links)
- Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere (Q3004662) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- Improved stretch factor of Delaunay triangulations of points in convex position (Q5918555) (← links)
