Implementing a Shortest Path on Polyhedron Algorithm

by Stephen Kiazyk for The CGAL Project

Implement Chen and Han's single-source shortest paths on a polyhedron algorithm, possibly augmented with the improvements given by Xin and Wang (2009), and also augmented to give shortest paths from a geodesic curve on the surface, rather than just a single point.