#include <CGAL/Triangulation_data_structure_3.h>

Inherits from

CGAL::Triangulation_utils_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 3D Triangulations).

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

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<TDS> and Triangulation_ds_cell_base_3<TDS> respectively.

Is Model Of:: TriangulationDataStructure_3

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

Attention: All members listed here are additional to the interface specified by the concept.

See Also: CGAL::Triangulation_ds_vertex_base_3; CGAL::Triangulation_ds_cell_base_3; CGAL::Triangulation_vertex_base_with_info_3; CGAL::Triangulation_cell_base_with_info_3

Examples:: Triangulation_3/linking_2d_and_3d.cpp, and Triangulation_3/tds.cpp.

Types
typedef Compact_container< Vertex >	Vertex_range
	Vertex container type. More...

typedef Compact_container< Cell >	Cell_range
	Cell container type. More...

Operations
Cell_range &	cells () const
	Returns a reference to the container of cells. More...

Cell_range &	cells ()
	Returns a reference to the container of cells. More...

Vertex_range &	vertices () const
	Returns a reference to the container of vertices. More...

Vertex_range &	vertices ()
	Returns a reference to the container of vertices. More...