CGAL 4.5 - Combinatorial Maps
|
![]() ![]() | |
![]() ![]() ![]() | The class Cell_attribute represents an attribute containing (or not) an information |
![]() ![]() ![]() | The class Combinatorial_map represents a dD combinatorial map |
![]() ![]() ![]() | The class Combinatorial_map_min_items is a model of the CombinatorialMapItems concept |
![]() ![]() ![]() | The class Dart represents a dD dart |
![]() ![]() | The concept CellAttribute represents a non void attribute associated with a cell of a combinatorial map. It can keep a handle to one dart of its associated cell, and can contain any information |
![]() ![]() | The concept CombinatorialMap defines a d-dimensional combinatorial map |
![]() ![]() | The concept CombinatorialMapItems allows to customize a dD combinatorial map by choosing the type of darts, and by enabling and disabling some attributes. For that, it defines an inner class template named Dart_wrapper, with one template parameter, CMap , a model of the CombinatorialMap concept. This inner class must define two types: Dart and Attributes |
![]() ![]() | The concept Dart defines a d-dimensional dart. A dart mainly stores handles to the darts linked with itself by βi, ∀i, 0 ≤i ≤d. Moreover, it stores also handles to each non void attribute associated with itself |