CGAL 6.2 - Combinatorial Maps

Loading...
Searching...
No Matches
Modules
Reference Manual

##

Guillaume Damiand
This package implements Combinatorial Maps in d dimensions. A combinatorial map is a data structure enabling to represent an orientable subdivided object by describing all the cells of the subdivision (for example in 3D vertices, edges, faces, volumes) and all the incidence and adjacency relationships between these cells. Information can be associated to cells thanks to attributes. In 2D, a combinatorial map is equivalent to a halfedge data structure. The package provides basic creation, modification operations, and several iterators enabling to run through some specific part of the object.
Introduced in: CGAL 3.9
BibTeX: cgal:d-cm-26a
License: LGPL

## Classified Reference Pages

## Concepts

- `GenericMap`
- `GenericMapItems`
- `CellAttribute`
- `CombinatorialMap`

## Classes

- `CGAL::Combinatorial_map<d,Items,Alloc>`
- `CGAL::Cell_attribute<CMap,Info_,Tag,OnMerge,OnSplit>`
- `CGAL::Cell_attribute_with_id<CMap,Info_,Tag,OnMerge,OnSplit>`
- `CGAL::Generic_map_min_items`

### IO Functions for CMap

- `std::ostream& operator<< (std::ostream& os, const GenericMap& amap)`
- `std::ifstream& operator>> (std::ifstream& is, GenericMap& amap)`

## Modules
| Concepts
| Classes
| IO Functions for CMap