scientific article; zbMATH DE number 910902
From MaRDI portal
Recommendations
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Approximating shortest paths on a convex polytope in three dimensions
- Computing approximate shortest paths on convex polytopes
- Approximating shortest paths on a nonconvex polyhedron
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
Cited in
(17)- Approximate shortest path on a polyhedral surface and its applications
- Linear time approximation of 3D convex polytopes
- On Shortest Paths in Polyhedral Spaces
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Total curvature and spiralling shortest paths
- Approximating shortest paths on a nonconvex polyhedron
- Approximate shortest paths in simple polyhedra
- Computational Science and Its Applications – ICCSA 2004
- scientific article; zbMATH DE number 7685241 (Why is no real title available?)
- An algorithm for shortest-path motion in three dimensions
- Approximate shortest distances among smooth obstacles in 3D
- Approximate shortest distances among smooth obstacles in 3D
- Computing approximate shortest paths on convex polytopes
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886077)
