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-18a
License: LGPL

Classified Reference Pages

Concepts

Classes

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

Global Functions

Constructions for Combinatorial Maps

CGAL::make_edge<CMap>
CGAL::make_combinatorial_polygon<CMap>
CGAL::make_combinatorial_tetrahedron<CMap>
CGAL::make_combinatorial_hexahedron<CMap>

Operations for Combinatorial Maps

CGAL::is_removable<CMap,i>
CGAL::remove_cell<CMap,i>
CGAL::is_insertable_cell_1_in_cell_2<CMap>
CGAL::is_insertable_cell_2_in_cell_3<CMap,InputIterator>
CGAL::insert_cell_0_in_cell_1<CMap>
CGAL::insert_cell_0_in_cell_2<CMap>
CGAL::insert_cell_1_in_cell_2<CMap>
CGAL::insert_dangling_cell_1_in_cell_2<CMap>
CGAL::insert_cell_2_in_cell_3<CMap,InputIterator>