Toggle Quick Contact Bar

Shortest Path on Triangulated Surface Mesh

  • Date Completed: December 2014 (available in CGAL 4.7)

Given a triangulated surface mesh as input and a set of source points on the mesh, the algorithm computes a data structure that can efficiently answer shortest path queries from any point on the mesh to the set of source points.

The initial implementation of this algorithm is the result of the work of Stephen Kiazyk during the 2014 season of the Google Summer of Code. He has been mentored by Sébastien Loriot and Éric Colin de Verdière.