CGAL::Triangulation_simplex_3<Triangulation_3>

Definition

The class Triangulation_simplex_3<Triangulation_3> stores a simplex of any dimension defined by the Triangulation_3 class. It also defines the operator less such that simplices can be stored in a map or a set of simplices. The simplex is invalidated by any change in the triangulation.

#include <CGAL/Triangulation_simplex_3.h>

Parameters

It is parameterized by the triangulation it derives the simplices from.

Types

typedef Triangulation_simplex_3<Triangulation_3>
Simplex; The simplex class itself.

typedef Triangulation_3::Vertex_handle
Vertex_handle;
typedef Triangulation_3::Edge Edge;
typedef Triangulation_3::Facet Facet;
typedef Triangulation_3::Cell_handle
Cell_handle;

typedef Triangulation_3::Cell_circulator
Cell_circulator;
typedef Triangulation_3::Facet_circulator
Facet_circulator;

typedef Triangulation_3::Edge_iterator
Edge_iterator;
typedef Triangulation_3::Facet_iterator
Facet_iterator;

typedef Triangulation_3::Finite_vertices_iterator
Finite_vertices_iterator;
typedef Triangulation_3::Finite_edges_iterator
Finite_edges_iterator;
typedef Triangulation_3::Finite_facets_iterator
Finite_facets_iterator;
typedef Triangulation_3::Finite_cells_iterator
Finite_cells_iterator;

Creation

Triangulation_simplex_3<Triangulation_3> simplex;
Initializes the simplex to an invalid simplex.


Triangulation_simplex_3<Triangulation_3> simplex ( Vertex_handle vh);
Triangulation_simplex_3<Triangulation_3> simplex ( Edge e);
Triangulation_simplex_3<Triangulation_3> simplex ( Facet f);
Triangulation_simplex_3<Triangulation_3> simplex ( Cell_handle ch);

Triangulation_simplex_3<Triangulation_3> simplex ( Cell_circulator ccir);
Triangulation_simplex_3<Triangulation_3> simplex ( Facet_circulator fcir);

Triangulation_simplex_3<Triangulation_3> simplex ( Edge_iterator eit);
Triangulation_simplex_3<Triangulation_3> simplex ( Facet_iterator fit);

Operations

int simplex.dimension () returns the dimension of the simplex.

Vertex_handle Vertex_handle ( simplex)
Returns the Vertex_handle stored in the simplex.
Precondition: dimension() == 0
Edge Edge ( simplex) Returns the Edge stored in the simplex.
Precondition: dimension() == 1
Facet Facet ( simplex) Returns the Facet stored in the simplex.
Precondition: dimension() == 2
Cell_handle Cell_handle ( simplex)
Returns the Cell_handle stored in the simplex.
Precondition: dimension() == 3

Cell_handle simplex.incident_cell () Returns a cell incident to the simplex.

bool simplex == s1 Test whether two simplices are equal.
bool simplex < s1 Defines a ordering on the simplices. This ordering depends on the memory layout and is independent of the geometry. Therefore, the ordering is not intrinsic

See Also

CGAL::Triangulation_3<TriangulationTraits_3,TriangulationDataStructure_3>