\( \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 5.0.2 - Linear Cell Complex
CGAL::Linear_cell_complex_min_items Struct Reference

#include <CGAL/Linear_cell_complex_min_items.h>

Definition

The class Linear_cell_complex_min_items defines void as the information associated with darts, and the attributes used.

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

Is Model Of:
LinearCellComplexItems
Deprecated:
Before CGAL 4.9, this class was templated by the dimension of the darts, and users must define the type of darts used (see also deprecated class Combinatorial_map_min_items). CGAL_CMAP_DART_DEPRECATED can be defined to keep the old behavior (only possible with Combinatorial_map and not for Generalized_map).

Example

The following example shows one implementation of the Linear_cell_complex_min_items class.

struct Linear_cell_complex_min_items
{
template <class LCC>
struct Dart_wrapper
{
typedef CGAL::Cell_attribute_with_point<LCC> Vertex_attrib;
typedef std::tuple<Vertex_attrib> Attributes;
};
};
See also
CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>
CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>