|
CGAL 6.0 - Triangulated Surface Mesh Shortest Paths
|
| ▼NCGAL | |
| ▼CSurface_mesh_shortest_path | Computes shortest surface paths from one or more source points on a surface mesh |
| CSource_point_iterator | A model of BidirectionalIterator to access the source points |
| CSurface_mesh_shortest_path_traits | A model of the concept SurfaceMeshShortestPathTraits as required by the Surface_mesh_shortest_path class |
| CSurfaceMeshShortestPathTraits | The concept SurfaceMeshShortestPathTraits describes the types, predicates, and constructions required by the traits class parameter of CGAL::Surface_mesh_shortest_path |
| CSurfaceMeshShortestPathVisitor | 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 |