@inproceedings{Choi1994ApproximateES,
title={Approximate Euclidean shortest path in 3-space},
author={J. Choi and J. Sellen and C. Yap},
booktitle={SCG '94},
year={1994}
}

Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. As this problem is NP-hard, his approach represents an important step towards practical algorithms. Unfortunately, there are non-trivial gaps in the original description. Besides giving a complete treatment, we also give an alternative to his subdivision method which has some nice properties. Among the tools needed are root-separation bounds and non-trivial applications of Brent's… CONTINUE READING