Computing Approximate Shortest Paths on Convex Polytopes

@article{Agarwal2001ComputingAS,
  title={Computing Approximate Shortest Paths on Convex Polytopes},
  author={Pankaj K. Agarwal and Sariel Har-Peled and Meetesh Karia},
  journal={Algorithmica},
  year={2001},
  volume={33},
  pages={227-242}
}
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algorithm for computing approximate shortest paths on a convex polyhedral surface. Given a convex polyhedral surface P in \reals3 , two points s, t ∈ P , and a parameter \eps > 0 , it computes a path between s and t on P whose length is at most (1+\eps) times the length of the shortest path between those points. It… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 28 CITATIONS

Improving Chen and Han's algorithm on the discrete geodesic problem

  • ACM Trans. Graph.
  • 2009
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Multiple shooting approach for computing approximately shortest paths on convex polytopes

  • J. Computational Applied Mathematics
  • 2017
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Shortest monotone descent path problem in polyhedral terrain

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Efficiently Computing Exact Geodesic Loops within Finite Steps

  • IEEE Transactions on Visualization and Computer Graphics
  • 2012
VIEW 1 EXCERPT