\( \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.6 - Linear Cell Complex
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Linear_cell_complex_min_items< d > Class Template Reference
Classes

#include <CGAL/Linear_cell_complex_min_items.h>

Definition

The class Linear_cell_complex_min_items defines the type of darts, which is a Dart_wrapper::Dart<d,LCC>, and the traits class used.

In this class, 0-attributes are enabled and associated with Cell_attribute_with_point.

Is Model Of:
LinearCellComplexItems
Template Parameters
dthe dimension of the combinatorial map.

Example

The following example shows one implementation of the Linear_cell_complex_min_items class.

template <unsigned int d>
struct Linear_cell_complex_min_items
{
template <class LCC>
struct Dart_wrapper
{
typedef CGAL::Dart<d, LCC> Dart;
typedef CGAL::Cell_attribute_with_point<LCC> Vertex_attrib;
typedef CGAL::cpp11::tuple<Vertex_attrib> Attributes;
};
};
See Also
CGAL::Linear_cell_complex<d,d2,LCCTraits,Items,Alloc>
CGAL::Dart<d,CMap>