CGAL 6.1.1 - Linear Cell Complex

Loading...
Searching...
No Matches
List of all members
CGAL::Linear_cell_complex_traits< d, K > Struct Template Reference
Reference Manual » Classes

`#include <CGAL/Linear_cell_complex_traits.h>`

## Inherits from

K.

## Definition

template<typename d, typename K>
struct CGAL::Linear_cell_complex_traits< d, K >

This geometric traits concept is used in the `Linear_cell_complex_for_combinatorial_map` and `Linear_cell_complex_for_generalized_map` classes.

It can take as parameter any model of the concept `Kernel` (for example any CGAL kernel), and defines inner types and functors corresponding to the given dimension.

Is model of
  `LinearCellComplexTraits`

Template Parameters

  d | the dimension of the kernel,
  K | a model of the concept `Kernel` if `d==2` or `d==3`; a model of the concept `Kernel_d` otherwise. Equal by default to `CGAL::Exact_predicates_inexact_constructions_kernel` if `d` is 2 or 3, and is `CGAL::Cartesian_d<double>` otherwise.

Note that the default argument used for `K` when d > 3 does not use exact predicates because operations that use predicates are only defined in 2D and 3D.

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>`

Examples
  Linear_cell_complex/linear_cell_complex_3_with_colored_vertices.cpp.

## Constants
static unsigned int | ambient_dimension = d