Triangulation_data_structure_3<TriangulationDSVertexBase_3,TriangulationDSCellBase

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

CGAL::Triangulation_data_structure_3<TriangulationDSVertexBase_3,TriangulationDSCellBase_3>

Definition

The class Triangulation_data_structure_3 stores a 3D-triangulation data structure and provides the optional geometric functionalities to be used as a parameter for a 3D-geometric triangulation (see Chapter 37).

The vertices and cells are stored in two nested containers, which are implemented using CGAL::Compact_container. The class may offer some flexibility for the choice of container in the future, in the form of additional template parameters.

#include <CGAL/Triangulation_data_structure_3.h>

Parameters

It is parameterized by base classes for vertices and cells which have to match the requirements for the concepts TriangulationDSCellBase_3 and TriangulationDSVertexBase_3 respectively .

They have the default values Triangulation_ds_vertex_base_3<> and Triangulation_ds_cell_base_3<> respectively.

Is Model for the Concepts

TriangulationDataStructure_3

Inherits From

CGAL::Triangulation_utils_3

The class Triangulation_utils_3 defines basic computations on indices of vertices and neighbors of cells.

In addition to the interface documented in the concept, the class offers the following types and functions.

Types

typedef CGAL::Compact_container<Vertex>
	Vertex_range;	Vertex container type.
typedef CGAL::Compact_container<Cell>
	Cell_range;	Cell container type.

Operations

Cell_range &	tds.cells ()	Returns a reference to the container of cells.
Cell_range &	tds.cells ()	Returns a reference to the container of cells.
Vertex_range &	tds.vertices ()	Returns a reference to the container of vertices.
Vertex_range &	tds.vertices ()	Returns a reference to the container of vertices.