TriangulationDSVertexBase

Navigation: Up, Table of Contents, Short Table of Contents, Package Overview, Bibliography, Index, Title Page

TriangulationDSVertexBase_3

Definition

At the bottom level of 3D-triangulations (see Sections 22.5 and 23.2), a vertex provides access to one of its incident cells through a handle.

Note that when you use the triangulation data structure as parameter of a geometric triangulation, the vertex base class has additional geometric requirements : it has to match the TriangulationVertexBase_3 concept.

Since the Triangulation data structure is the class which defines the handle types, the vertex base class has to be somehow parameterized by the Triangulation data structure. But since it is itself parameterized by the cell and vertex base classes, there is a cycle in the definition of these classes. In order to break the cycle, the base classes for vertex and cell which are given as arguments for the Triangulation data structure use void as Triangulation data structure parameter, and the Triangulation data structure then uses a rebind-like mechanism (similar to the one specified in std::allocator) in order to put itself as parameter to the vertex and cell classes. The rebound base classes so obtained are the classes which are used as base classes for the final vertex and cell classes. More information can be found in Section 23.2.

Types

The class TriangulationDSVertexBase_3 has to define the following types.

template <typename TDS2>

TriangulationDSVertexBase_3:: struct Rebind_TDS;
This nested template class has to define a type Other which is the rebound vertex, that is, the one whose Triangulation_data_structure will be the actually used one. The Other type will be the real base class of Triangulation_data_structure_3::Vertex.

typedef TriangulationDataStructure_3
Triangulation_data_structure;

typedef TriangulationDataStructure_3::Vertex_handle
Vertex_handle;

typedef TriangulationDataStructure_3::Cell_handle
Cell_handle;

Creation

TriangulationDSVertexBase_3 v;
Default constructor.

TriangulationDSVertexBase_3 v ( Cell_handle c);
Constructs a vertex pointing to cell c.

Operations

Access Functions

Cell_handle v.cell () Returns the pointer to an incident cell

Setting

void v.set_cell ( Cell_handle c)
Sets the incident cell.

Checking

bool	v.is_valid ( bool verbose=false, int level=0)
		Performs any desired test on a vertex. Checks that the pointer to an incident cell is not the default constructed handle.

Various

void * v.for_compact_container ()

void * & v.for_compact_container ()

These member functions are required by Triangulation_data_structure_3 because it uses Compact_container to store its cells. See the documentation of Compact_container for the exact requirements.

I/O

istream& istream& is >> & v
Inputs the non-combinatorial information given by the vertex.

ostream& ostream& os << v Outputs the non-combinatorial information given by the vertex.

Has Models

CGAL::Triangulation_ds_vertex_base_3
CGAL::Triangulation_vertex_base_3
CGAL::Triangulation_vertex_base_with_info_3
CGAL::Triangulation_hierarchy_vertex_base_3

template <typename TDS2>
TriangulationDSVertexBase_3:: struct Rebind_TDS;
	This nested template class has to define a type Other which is the rebound vertex, that is, the one whose Triangulation_data_structure will be the actually used one. The Other type will be the real base class of Triangulation_data_structure_3::Vertex.

typedef TriangulationDataStructure_3
	Triangulation_data_structure;
typedef TriangulationDataStructure_3::Vertex_handle
	Vertex_handle;
typedef TriangulationDataStructure_3::Cell_handle
	Cell_handle;

TriangulationDSVertexBase_3 v;
	Default constructor.
TriangulationDSVertexBase_3 v ( Cell_handle c);
	Constructs a vertex pointing to cell c.

void *	v.for_compact_container ()
void &*	v.for_compact_container ()

istream&	istream& is >> & v
		Inputs the non-combinatorial information given by the vertex.

ostream&	ostream& os << v	Outputs the non-combinatorial information given by the vertex.