Approximate Euclidean shortest path in 3-space

@inproceedings{Choi1994ApproximateES,
  title={Approximate Euclidean shortest path in 3-space},
  author={J. Choi and J. Sellen and C. Yap},
  booktitle={SCG '94},
  year={1994}
}
  • J. Choi, J. Sellen, C. Yap
  • Published in SCG '94 1994
  • Mathematics, Computer Science
  • 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
    86 Citations
    Shortest Paths in a Cuboidal World
    • 8
    Euclidean Shortest Paths in Simple Cube Curves at a Glance
    • 1
    • PDF
    Precision-Sensitive Euclidean Shortest Path in 3-Space
    • 44
    • PDF
    Constructing approximate shortest path maps in three dimensions
    • 56
    • PDF
    Practical methods for approximating shortest paths on a convex polytope in R3
    • 52
    • PDF
    Simplicial dijkstra and A* algorithms for optimal feedback planning
    • 30
    • PDF