On Shortest Paths Amidst Convex Polyhedra

DOI10.1137/0216038zbMath0619.52006OpenAlexW2123976412MaRDI QIDQ3756075

Micha Sharir

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0216038

zbMATH Keywords

computational geometryconvex polyhedraEuclidean shortest paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computing methodologies and applications (68U99) Paths and cycles (05C38) Polytopes and polyhedra (52Bxx)

Related Items (8)

Star unfolding of a polytope with applications ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ A survey of motion planning and related geometric algorithms ⋮ A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ Search for shortest path around semialgebraic obstacles in the plane ⋮ 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

This page was built for publication: On Shortest Paths Amidst Convex Polyhedra