T_Triangulation_extension_3< Triangulation3, TriangulationExtension3Base > Class Template Reference

Defines simple predicates and constructions structure over a triangulation. More...

#include <Triangulation_extension_3.hpp>

Public Types
typedef Triangulation3::Vertex_handle	Vertex_handle
	Representation of a vertex in the 3D Triangulation. More...
typedef Triangulation3::Cell_handle	Cell_handle
	Representation of a cell in the 3D Triangulation. More...
typedef Triangulation3::Edge	Edge
	Representation of an edge in the 3D Triangulation. More...
typedef Triangulation3::Facet	Facet
	Representation of a facet in the 3D Triangulation. More...

Detailed Description

template<class Triangulation3, class TriangulationExtension3Base = T_Triangulation_extension_3_base<Triangulation3>>
class SBL::GT::T_Triangulation_extension_3< Triangulation3, TriangulationExtension3Base >

Defines simple predicates and constructions structure over a triangulation.

Template Parameters

Triangulation3

A Model of the 3D Triangulation from the CGAL Library.

Member Typedef Documentation

Cell_handle

typedef Triangulation3:: Cell_handle Cell_handle

inherited

Representation of a cell in the 3D Triangulation.

More precisely, it is a pointer over a geometric and combinatorial data structure representing a tetrahedron of the triangulation. The cell is always associated to thhe four vertices bounding the tetrahedron.

Edge

typedef Triangulation3:: Edge Edge

inherited

Representation of an edge in the 3D Triangulation.

It is a triple (Cell_handle, int, int), where the two integers are the indices of its source and target vertices in the associated cell.

Facet

typedef Triangulation3:: Facet Facet

inherited

Representation of a facet in the 3D Triangulation.

It is a pair (Cell_handle, int), where the cell is a coface of the facet and the integer is the index of the vertex of the associated cell not in the facet.

Vertex_handle

typedef Triangulation3:: Vertex_handle Vertex_handle

inherited

Representation of a vertex in the 3D Triangulation.

More precisely, it is a pointer over a geometric and combinatorial data structure representing a point of the triangulation. The vertex is always associated to an incident tetrahedron of the triangulation.