Efficient Computation of Geodesic Shortest Paths

  title={Efficient Computation of Geodesic Shortest Paths},
  author={Sanjiv Kapoor},
This paper describes an efficient algorithm for the geodesic shortest, nath oroblem. i.e. the problem of finding shortest path; bet&n pa& of points on the surface of a 3dimensional polyhedron such that the path is constrained to lie on the surface of the polyhedron. We use the wavefront method and show an O(nlog%) time bound for this problem, when there are O(n) vertices and edges on the polyhedron. 
Highly Cited
This paper has 127 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
75 Citations
1 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 75 extracted citations

128 Citations

Citations per Year
Semantic Scholar estimates that this publication has 128 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Technical Report 1495

  • On finding shortest paths on conva polyhedra, D. Mount
  • Dept. of Computer Science, Univ. of Maryland…
  • 1985
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…