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
    44 Citations
    Approximate Shortest Paths in Simple Polyhedra
    • 3
    • PDF
    Approximate Shortest Path Calculations in Simple Polyhedra
    • 2
    • PDF
    New results on shortest paths in three dimensions
    • 75
    • Highly Influenced
    • PDF
    Paths in Simple Polyhedrons
    Guaranteed precision for transcendental and algebraic computation made easy
    • 8
    • PDF
    Euclidean Shortest Paths in Simple Polygons
    • 5

    References

    SHOWING 1-10 OF 19 REFERENCES
    Efficient computation of Euclidean shortest paths in the plane
    • J. Hershberger, S. Suri
    • Mathematics, Computer Science
    • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
    • 1993
    • 73
    • PDF
    Approximate Euclidean shortest path in 3-space
    • 86
    On shortest paths in polyhedral spaces
    • 171
    On Shortest Paths in Polyhedral Spaces
    • 254
    Towards Exact Geometric Computation
    • C. Yap
    • Mathematics, Computer Science
    • Comput. Geom.
    • 1997
    • 225
    • PDF
    New lower bound techniques for robot motion planning problems
    • J. Canny, J. Reif
    • Computer Science
    • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
    • 1987
    • 571
    NP is as easy as detecting unique solutions
    • 595
    Computing Sums of Radicals in Polynomial Time
    • 31
    • PDF
    An Algorithm for Shortest-Path Motion in Three Dimensions
    • 234