An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

Discrete and Computational Geometry

Volumn 39, Issue 1-3, 2008, Pages 500-579

  Schreiber, Yevgeny ^a   Sharir, Micha ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Continuous Dijkstra; Geodesics; Polytope surface; Shortest path; Shortest path map; Unfolding; Wavefront

Indexed keywords

EID: 40349114629     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-007-9031-0     Document Type: Conference Paper

References (39)