Pages that link to "Item:Q1283768"
From MaRDI portal
The following pages link to Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions (Q1283768):
Displaying 9 items.
- Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\) (Q390105) (← links)
- Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Computing approximate shortest paths on convex polytopes (Q1601017) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
