• DOI:10.1137/S0097539798340205
Corpus ID: 6410871

Precision-Sensitive Euclidean Shortest Path in 3-Space

@article{Sellen2000PrecisionSensitiveES,
  title={Precision-Sensitive Euclidean Shortest Path in 3-Space},
  author={J. Sellen and J. Choi and C. Yap},
  journal={SIAM J. Comput.},
  year={2000},
  volume={29},
  pages={1577-1595}
}

J. Sellen, J. Choi, C. Yap

Published 2000

Mathematics, Computer Science

SIAM J. Comput.

This paper introduces the concept of precision-sensitive algorithms, analogous to the well-known output-sensitive algorithms. We exploit this idea in studying the complexity of the 3-dimensional Euclidean shortest path problem. Specifically, we analyze an incremental approximation approach and show that this approach yields an asymptotic improvement of running time. By using an optimization technique to improve paths on fixed edge sequences, we modify this algorithm to guarantee a relative… CONTINUE READING

View PDF

Save to Library

Create Alert

Cite

Launch Research Feed