\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.11.1 - Triangulated Surface Mesh Shortest Paths
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 123]
oNCGAL
|oNSurface_mesh_shortest_paths_3Namespace containing support members specific to this package
|oCSurface_mesh_shortest_path_traitsA model of the concept SurfaceMeshShortestPathTraits as required by the Surface_mesh_shortest_path class
|\CSurface_mesh_shortest_pathComputes shortest surface paths from one or more source points on a surface mesh
| \CSource_point_iteratorA model of BidirectionalIterator to access the source points
oCSurfaceMeshShortestPathTraitsThe concept SurfaceMeshShortestPathTraits describes the types, predicates, and constructions required by the traits class parameter of CGAL::Surface_mesh_shortest_path
\CSurfaceMeshShortestPathVisitorThe concept SurfaceMeshShortestPathVisitor describes the requirements of the visitor type used to collect the edges and vertices traversed by a shortest path on the surface of a triangulated surface mesh