An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles
From MaRDI portal
Publication:3471860
DOI10.1115/1.3153072zbMath0695.90071OpenAlexW2129253688MaRDI QIDQ3471860
Publication date: 1989
Published in: Journal of Dynamic Systems, Measurement, and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1115/1.3153072
This page was built for publication: An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles