A single-exponential upper bound for finding shortest paths in three dimensions

DOI10.1145/185675.185811MaRDI QIDQ4323732zbMATH OpenOpenAlexFDO

Authors James A. Storer, J. Reif

Publication date 20 February 1995

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/185675.185811

zbMATH Keywords

minimal movement problemmotion planningroboticsshortest path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4064475
• On Shortest Paths in Polyhedral Spaces
• An algorithm for shortest-path motion in three dimensions
• New results on shortest paths in three dimensions
• On the shortest paths between two convex polyhedra

Cited in

(4)

• On optimal route planning evading cubes in the three space
• Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
• New results on shortest paths in three dimensions
• Time-minimal paths amidst moving obstacles in three dimensions

This page was built for publication: A single-exponential upper bound for finding shortest paths in three dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323732)