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

#include <Triangulation_extension_3.hpp>

Classes
class	Canonical_edge
	Canonical representation of an edge in the 3D Triangulation. More...

class	Canonical_facet
	Canonical representation of a facet in the 3D Triangulation. More...

class	Get_common_facet
	Given two cells, return the common facet of the two cells. More...

class	Get_other_two_edges
	Given an edge and a facet bounding it, return the two other edges of the facet. More...

class	Is_coface
	Check that a simplex is the coface of a second simplex. More...

class	Is_counter_clockwise_oriented
	Predicate checking that a facet of the 3D triangulation is counter-clockwise oriented. More...

class	T_Vertex_handle_with_order
	Check that a simplex is the coface of a second simplex. More...

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 SBL::GT::T_Triangulation_extension_3_base< Triangulation3 >

Defines simple predicates and constructions structure over a triangulation.

This base class is used for implementing all the structures that sould be in this extension. The main class inherits from this base class for using partial template specialization over a limited number of types (T_Vertex_handle_with_order)

Template Parameters

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

Member Typedef Documentation

◆ Cell_handle

typedef Triangulation3:: Cell_handle Cell_handle

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

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

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

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.

Classes

Public Types