This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on three-dimensional polyhedral surfaces. The goal of this survey is to identify the most relevant open problems, both theoretical and practical.

Additional Metadata
Keywords Computational geometry, Polyhedral surfaces, Shortest paths, Three-dimensional shortest paths
Persistent URL dx.doi.org/10.1016/j.comgeo.2011.05.006
Journal Computational Geometry
Citation
Bose, P, Maheshwari, A, Shu, C. (Chang), & Wuhrer, S. (Stefanie). (2011). A survey of geodesic paths on 3D surfaces. Computational Geometry (Vol. 44, pp. 486–498). doi:10.1016/j.comgeo.2011.05.006