An algorithm for shortest-path motion in three dimensions
We describe a fully polynomial approximation scheme for the problem of finding the shortest distance between two points in three-dimensional space in the presence of polyhedral obstacles. The fastest algorithm known for the exact solution of this problem is doubly exponential.
scientific article; zbMATH DE number 3974319