On Shortest Paths Amidst Convex Polyhedra
From MaRDI portal
Recommendations
Cited in
(25)- Time and space efficient algorithms for shortest paths between convex polygons
- A survey of motion planning and related geometric algorithms
- Search for shortest path around semialgebraic obstacles in the plane
- Total curvature and spiralling shortest paths
- Walking around fat obstacles.
- The shortest path AMID 3-D polyhedral obstacles
- Shortest paths in simple polygons with polygon-meet constraints
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Approximating shortest paths on a nonconvex polyhedron
- The Number of Shortest Paths on the Surface of a Polyhedron
- scientific article; zbMATH DE number 3934326 (Why is no real title available?)
- On Shortest Paths in Polyhedral Spaces
- An O(n2) shortest path algorithm for a non-rotating convex body
- On the shortest paths between two convex polyhedra
- scientific article; zbMATH DE number 4064475 (Why is no real title available?)
- scientific article; zbMATH DE number 140474 (Why is no real title available?)
- Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Star unfolding of a polytope with applications
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Shortest paths on polyhedral surfaces and terrains
- Shortest paths, single origin‐destination network design, and associated polyhedra
- An optimal-time algorithm for shortest paths on realistic polyhedra
This page was built for publication: On Shortest Paths Amidst Convex Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756075)
