CGAL 6.2 - Surface Mesh Topology

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 |
▼N Surface_mesh_topology |
C Curves_on_surface_topology | The class `Curves_on_surface_topology` provides methods to compute shortest non contractible cycles and to test homotopy on paths
C Euclidean_length_weight_functor | A model of `WeightFunctor` assigning its Euclidean length to every edge
C Path_on_surface | The class `Path_on_surface` represents a walk in a mesh which is either a model of `CombinatorialMap`, a model of `GeneralizedMap` or a model of a `FaceGraph`
C Polygonal_schema_min_items | The class `Polygonal_schema_min_items` defines a struct with a `std::string` as the information associated with darts, and no attribute is enabled
C Polygonal_schema_with_combinatorial_map | The class `Polygonal_schema_with_combinatorial_map` is a model of `PolygonalSchema` using `Combinatorial_map` as underlying model
C Polygonal_schema_with_generalized_map | The class `Polygonal_schema_with_generalized_map` is a model of `PolygonalSchema` using `Generalized_map` as underlying model
C Unit_weight_functor | A model of `WeightFunctor` assigning unit weight to every edge
C PolygonalSchema | The concept `PolygonalSchema` defines a 2D polygonal schema, i.e. a combinatorial surface with labeled edges. A PolygonalSchema is created incrementally by adding facets one at a time. A label is any word, that does not contain a space
C PolygonalSchemaItems | The concept `PolygonalSchemaItems` allows to customize a `PolygonalSchema` by choosing the information associated with darts, and by enabling and disabling some attributes. `Dart_wrapper<Map>::Dart_info`, should be a class having a public data member std::string m_label
C WeightFunctor | The concept `WeightFunctor` defines a functor to calculate the weight of an edge