This is an implementation of exact discrete geodesic algorithm proposed in [1] and improved in [2]. It computes geodesics on 2-manifold triangular meshes.
Note that the algorithm itself can apply on both orientable and non-orientable surfaces, but here only orientable case is supported due to the data structure adopted.
[1] Chen J, Han Y. Shortest paths on a polyhedron[C]//Proceedings of the sixth annual symposium on Computational geometry. ACM, 1990: 360-369.
[2] Xin S Q, Wang G J. Improving Chen and Han's algorithm on the discrete geodesic problem[J]. ACM Transactions on Graphics (TOG), 2009, 28(4): 104.