CGAL 4.7 - Combinatorial Maps: CGAL Namespace Reference

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - Combinatorial Maps

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes | Functions
CGAL Namespace Reference

## Classes

class | Cell_attribute
| The class `Cell_attribute` represents an attribute containing (or not) an information. More...
class | Combinatorial_map
| The class `Combinatorial_map` represents a dD combinatorial map. More...
class | Combinatorial_map_min_items
| The class `Combinatorial_map_min_items` is a model of the `CombinatorialMapItems` concept. More...
class | Dart
| The class `Dart` represents a dD dart. More...

## Functions

template<class CMap >
CMap::Dart_handle | make_combinatorial_hexahedron (CMap &cm)
| Creates a combinatorial hexahedron (six combinatorial quadrangles linked together by \( \beta_2\)), and adds it in `cm`. More...
template<class CMap >
CMap::Dart_handle | make_combinatorial_polygon (CMap &cm, unsigned int lg)
| Creates a combinatorial polygon of length `lg` (`lg` darts linked by \( \beta_1\)), and adds it in `cm`. More...
template<class CMap >
CMap::Dart_handle | make_combinatorial_tetrahedron (CMap &cm)
| Creates a combinatorial tetrahedron (four combinatorial triangles linked together by \( \beta_2\)), and adds it in `cm`. More...
template<class CMap >
CMap::Dart_handle | make_edge (CMap &cm)
| Creates an isolated edge (two darts linked by \( \beta_2\)) and adds it in `cm`. More...
template<class CMap >
CMap::Dart_handle | insert_cell_0_in_cell_1 (CMap &cm, typename CMap::Dart_handle dh)
| Inserts a 0-cell in the 1-cell containing `dh`. More...
template<class CMap >
CMap::Dart_handle | insert_cell_0_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)
| Inserts a 0-cell in the 2-cell containing `dh`. More...
template<class CMap >
CMap::Dart_handle | insert_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh1, typename CMap::Dart_handle dh2)
| Inserts a 1-cell in the 2-cell containing `dh1` and `dh2`. More...
template<class CMap , class InputIterator >
CMap::Dart_handle | insert_cell_2_in_cell_3 (CMap &cm, InputIterator afirst, InputIterator alast)
| Inserts a 2-cell along the path of 1-cells containing darts given by the range `[afirst,alast)`. More...
template<class CMap >
CMap::Dart_handle | insert_dangling_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)
| Inserts a 1-cell in a the 2-cell containing `dh`, the 1-cell being attached only by one of its extremity to the 0-cell containing `dh`. More...
template<class CMap >
bool | is_insertable_cell_1_in_cell_2 (const CMap &cm, typename CMap::Dart_const_handle dh1, typename CMap::Dart_const_handle dh2)
| Returns true iff it is possible to insert a 1-cell in `cm` between `dh1` and `dh2`. More...
template<class CMap , class InputIterator >
bool | is_insertable_cell_2_in_cell_3 (const CMap &cm, InputIterator afirst, InputIterator alast)
| Returns true iff it is possible to insert a 2-cell in `cm` along the path of darts given by the range `[afirst,alast)`. More...
template<class CMap , unsigned int i>
bool | is_removable (const CMap &cm, typename CMap::Dart_const_handle dh)
| Returns true iff the i-cell containing `dh` can be removed. More...
template<class CMap , unsigned int i>
CMap::size_type | remove_cell (CMap &cm, typename CMap::Dart_handle dh)
| Removes the i-cell containing `dh`. More...