\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.7 - dD Triangulations
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Triangulation Classes
dD Triangulations

Classes

class  CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure >
 This class is used to maintain the Delaunay triangulation of a set of points in \( \mathbb{R}^D \). More...
 
class  CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >
 This class implements triangulations of point sets in dimensions \( d \). More...
 
class  CGAL::Triangulation_data_structure< Dimensionality, TriangulationDSVertex, TriangulationDSFullCell >
 This class is a data structure used for storing a triangulation of dimension \( d\leq D\) (D is the maximal dimension). More...
 

Handles and Iterators

The vertices and full cells of triangulations are accessed through handles and iterators.

A handle is a model of the Handle concept, and supports the two dereference operators: operator* and operator->. Iterators are bidirectional and non-mutable. They are convertible to the corresponding handles, thus the user can pass them directly as arguments to the functions.

enum  CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Locate_type {
  CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::ON_VERTEX =0, CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::IN_FACE, CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::IN_FACET, CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::IN_FULL_CELL,
  CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::OUTSIDE_CONVEX_HULL, CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::OUTSIDE_AFFINE_HULL
}
 specifies which case occurs when locating a point in the triangulation. More...
 
typedef
TriangulationDataStructure::Vertex_handle 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_handle
 handle to a a vertex More...
 
typedef
TriangulationDataStructure::Vertex_const_handle 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_const_handle
 const handle to a a vertex More...
 
typedef
TriangulationDataStructure::Vertex_iterator 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_iterator
 iterator over all vertices (including the infinite one) More...
 
typedef
TriangulationDataStructure::Vertex_const_iterator 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_const_iterator
 const iterator over all vertices (including the infinite one) More...
 
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_vertex_iterator
 iterator over finite vertices More...
 
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_vertex_const_iterator
 const iterator over finite vertices More...
 
typedef
TriangulationDataStructure::Full_cell_handle 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_handle
 handle to a full cell More...
 
typedef
TriangulationDataStructure::Full_cell_const_handle 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_const_handle
 const handle to a full cell More...
 
typedef
TriangulationDataStructure::Full_cell_iterator 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_iterator
 iterator over all full cells (including the infinite ones) More...
 
typedef
TriangulationDataStructure::Full_cell_const_iterator 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_const_iterator
 const iterator over all full cells (including the infinite ones) More...
 
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_full_cell_iterator
 iterator over finite full cells More...
 
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_full_cell_const_iterator
 const iterator over finite full cells More...
 
typedef
TriangulationDataStructure::Facet_iterator 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Facet_iterator
 iterator over all facets (including the infinite ones) More...
 
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_facet_iterator
 iterator over finite facets More...
 
typedef
TriangulationDataStructure::size_type 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::size_type
 Size type (an unsigned integral type). More...
 
typedef
TriangulationDataStructure::difference_type 		CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::difference_type
 Difference type (a signed integral type). More...
 

Typedef Documentation

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::difference_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::difference_type

Difference type (a signed integral type).

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Facet_iterator CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Facet_iterator

iterator over all facets (including the infinite ones)

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_facet_iterator

iterator over finite facets

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_full_cell_const_iterator

const iterator over finite full cells

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_full_cell_iterator

iterator over finite full cells

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_vertex_const_iterator

const iterator over finite vertices

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef unspecified_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Finite_vertex_iterator

iterator over finite vertices

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Full_cell_const_handle CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_const_handle

const handle to a full cell

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Full_cell_const_iterator CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_const_iterator

const iterator over all full cells (including the infinite ones)

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Full_cell_handle CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_handle

handle to a full cell

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Full_cell_iterator CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Full_cell_iterator

iterator over all full cells (including the infinite ones)

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::size_type CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::size_type

Size type (an unsigned integral type).

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Vertex_const_handle CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_const_handle

const handle to a a vertex

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Vertex_const_iterator CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_const_iterator

const iterator over all vertices (including the infinite one)

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Vertex_handle CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_handle

handle to a a vertex

template<typename TriangulationTraits, typename TriangulationDataStructure>
typedef TriangulationDataStructure::Vertex_iterator CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure >::Vertex_iterator

iterator over all vertices (including the infinite one)

Enumeration Type Documentation

template<typename TriangulationTraits, typename TriangulationDataStructure>
enum CGAL::Triangulation::Locate_type

specifies which case occurs when locating a point in the triangulation.

Enumerator
ON_VERTEX 

when the located point coincides with a vertex of the triangulation

IN_FACE 

when the point is in the interior of a face of dimension equal or less than maximal_dimension() - 2

IN_FACET 

when the point is in the interior of a facet

IN_FULL_CELL 

when the point is in the interior of a full cell

OUTSIDE_CONVEX_HULL 

when the point is outside the convex hull but in the affine hull of the current triangulation

OUTSIDE_AFFINE_HULL 

when the point is outside the affine hull of the current triangulation.