Triangulated Surface Mesh Geodesic Shortest Paths Reference

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.

Introduced in: CGAL 4.7
BibTeX: cgal:klcdv-tsmsp-24b
License: GPL
Windows Demo: CGAL Lab

Classified Reference Pages

Concepts

• SurfaceMeshShortestPathTraits
• SurfaceMeshShortestPathVisitor

Classes

• CGAL::Surface_mesh_shortest_path<SurfaceMeshShortestPathTraits,VertexIndexMap, HalfedgeIndexMap, FaceIndexMap, VertexPointMap>
• CGAL::Surface_mesh_shortest_path_traits<Kernel, FaceListGraph>

Enums

• CGAL::Surface_mesh_shortest_paths_3::Barycentric_coordinates_type

Modules
	Concepts
	Traits Classes

Files
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.

Classes
class	CGAL::Surface_mesh_shortest_path< Traits, VIM, HIM, FIM, VPM >
	Computes shortest surface paths from one or more source points on a surface mesh. More...