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

DOI10.1145/185675.185811zbMath0814.68079OpenAlexW1983223843MaRDI QIDQ4323732

James A. Storer, John H. 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

shortest pathmotion planningroboticsminimal movement problem

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)

Related Items (1)

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