Approximating shortest paths on a convex polytope in three dimensions
From MaRDI portal
Publication:4377587
Recommendations
Cited in
(21)- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- A survey of geodesic paths on 3D surfaces
- Computing approximate shortest paths on convex polytopes
- An optimal-time algorithm for shortest paths on realistic polyhedra
- On time-optimal trajectories in non-uniform mediums
- Approximate Euclidean shortest paths amid convex obstacles
- Constructing Approximate Shortest Path Maps in Three Dimensions
- On the total curvature of minimizing geodesics on convex surfaces
- Geometric spanners for weighted point sets
- Three-dimensional Euclidean distance transformation and its application to shortest path planning
- Total curvature and spiralling shortest paths
- Approximating shortest paths on a nonconvex polyhedron
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
- Time-minimal paths amidst moving obstacles in three dimensions
- Efficiently approximating polygonal paths in three and higher dimensions
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Linear time approximation of 3D convex polytopes
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- scientific article; zbMATH DE number 910902 (Why is no real title available?)
This page was built for publication: Approximating shortest paths on a convex polytope in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377587)
