CGAL 6.1 - Triangulated Surface Mesh Shortest Paths

Loading...
Searching...
No Matches
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 1 2 3]

▼N CGAL |
▼C Surface_mesh_shortest_path | Computes shortest surface paths from one or more source points on a surface mesh
C Source_point_iterator | A model of `BidirectionalIterator` to access the source points
C Surface_mesh_shortest_path_traits | A model of the concept `SurfaceMeshShortestPathTraits` as required by the `Surface_mesh_shortest_path` class
C SurfaceMeshShortestPathTraits | The concept `SurfaceMeshShortestPathTraits` describes the types, predicates, and constructions required by the traits class parameter of `CGAL::Surface_mesh_shortest_path`
C SurfaceMeshShortestPathVisitor | The 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