Precision-sensitive Euclidean shortest path in 3-space (extended abstract)
Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap · 1995
This paper introduces the concept of precisionsensitive algorithms, in analogy to the well-known output-sensitive algorithms.We exploit this idea in studying the complexity of the 3-dimensional Euclidean shortest path problem.