Dart<d,CMap>

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

CGAL::Dart<d,CMap>

Definition

The class Dart<d,CMap> represents a dD dart.

β_i pointers are coded in a array of d+1 Dart_handle (because we describe also the β₀ link). Attributes are associated to each dart by Attribute_handle<i>, one for each non void i-attribute.

Is Model for the Concepts

Dart

Parameters

d an integer for the dimension of the dart.
CMap must be a model of the CombinatorialMap concept.

Types

typedef CMap::Dart_handle	Dart_handle;
typedef CMap::Dart_const_handle	Dart_const_handle;

typedef CMap::Attribute_handle<i>::type Attribute_handle<i>
	::type;
typedef CMap::Attribute_const_handle<i>::type Attribute_const_handle<i>
	::type;

Complexity

Each β_i link is initialized to CMap::null_dart_handle, and each attribute handle of non void i-attribute is initialized to NULL at the creation of the dart, thus the complexity of the creation is in O(d+1).

The complexity of opposite and other_extremity methods is in O(d+1).