Stephen Kiazyk, Sébastien Loriot, and Éric Colin de Verdière
The package provides methods for computing geodesic shortest path on triangulated surface meshes. The algorithm used is based on a paper by Xin and Wang
[3] . The input of this package can be any model of the
FaceListGraph concept.
Concepts
Classes
Enums
|
| file | Surface_mesh_shortest_path.h |
| | Convenience header file only including CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h and CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h.
|
| |