CGAL 6.1.1 - Combinatorial Maps

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]

▼N CGAL |
C Cell_attribute | The class `Cell_attribute` represents an attribute containing (or not) an information
C Cell_attribute_with_id | The class `Cell_attribute_with_id` represents an attribute containing (or not) an information, and having an id
C Combinatorial_map | The class `Combinatorial_map` represents a dD combinatorial map
C Generic_map_min_items | The class `Generic_map_min_items` defines `void` as the information associated with darts, and no attribute is enabled
C CellAttribute | The concept `CellAttribute` represents a non void attribute associated with a cell of a generic map. It can keep a descriptor to one dart of its associated cell, and can contain any information
C CombinatorialMap | The concept `CombinatorialMap` defines a d-dimensional combinatorial map
C GenericMap | The concept `GenericMap` defines a d-dimensional generic map. This concept is defined only to factorize the common notions between `CombinatorialMap` and `GeneralizedMap` concepts
C GenericMapItems | The concept `GenericMapItems` allows to customize a dD generic map by choosing the information associated with darts, by enabling and disabling some attributes, and by choosing to use indices or handles. For that, it defines an inner class template named `Dart_wrapper`, with one template parameter, `Map`, a model of the `GenericMap` concept. This inner class can define the two types `Dart_info` and `Attributes`