An efficient parallel solution for Euclidean shortest path in three dimensions

@article{Bajaj1986AnEP,
title={An efficient parallel solution for Euclidean shortest path in three dimensions},
author={C. Bajaj},
journal={Proceedings. 1986 IEEE International Conference on Robotics and Automation},
year={1986},
volume={3},
pages={1897-1900}
}

Proceedings. 1986 IEEE International Conference on Robotics and Automation

We describe an efficient parallel solution for the problem of finding the shortest Euclidean path between two points in three dimensional space in the presence of polyhedral obstacles. We consider the important case where the order in which the obstacles are encountered in this shortest path is known. In particular for this case we describe an efficient parallel numerical iterative method on a concurrent-read exclusive-write synchronous shared-memory model. The iterations are essentially… CONTINUE READING