\( \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.11.3 - dD Triangulations
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 12]
oNboost
oNCGAL
|oCDelaunay_triangulationThis class is used to maintain the Delaunay triangulation of a set of points in \( \mathbb{R}^D \)
|oCRegular_triangulationThis class is used to maintain the regular triangulation – also known as weighted Delaunay triangulation – of a set of weighted points in \( \mathbb{R}^D \)
|oCRegular_triangulation_traits_adapterThe class Regular_triangulation_traits_adapter is used internally by the class Regular_triangulation to wrap its first template parameter (RegularTriangulationTraits_) so that the base class Triangulation manipulates weighted points instead of bare points
|oCTriangulationThis class implements triangulations of point sets in dimension \( d \)
|oCTriangulation_data_structureThis class is a data structure used for storing a triangulation of dimension \( d\leq D\) (D is the maximal dimension)
|oCTriangulation_ds_full_cellThis class is the default model used for the full cell of the class Triangulation_data_structure
|oCTriangulation_ds_vertexThe class Triangulation_ds_vertex serves as the default vertex template parameter in the class Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>
|oCTriangulation_faceA Triangulation_face is a model of the concept TriangulationDSFace
|oCTriangulation_full_cellThe class Triangulation_full_cell is a model of the concept TriangulationFullCell
|\CTriangulation_vertexThe class Triangulation_vertex is a model of the concept TriangulationVertex
oCDelaunayTriangulationTraitsThis concept describes the geometric types and predicates required to build a Delaunay triangulation. It corresponds to the first template parameter of the class CGAL::Delaunay_triangulation<DelaunayTriangulationTraits_, TriangulationDataStructure_>
oCFullCellDataThe concept FullCellData describes the requirements on the type which is used to mark some full cells, during modifications of the triangulation data structure
oCRegularTriangulationTraitsThis concept describes the geometric types and predicates required to build a regular triangulation. It corresponds to the first template parameter of the class CGAL::Regular_triangulation<RegularTriangulationTraits_, TriangulationDataStructure_>
oCTriangulationDataStructureThe TriangulationDataStructure concept describes objects responsible for storing and maintaining the combinatorial part of a \( d\)-dimensional pure simplicial complex that has the topology of the \( d\)-dimensional sphere \( \mathbb{S}^d\) with \( d\in[-2,D]\). Since the simplicial \( d\)-complex is pure, all faces are sub-faces of some \( d\)-simplex. And since it has the topology of the sphere \( \mathbb{S}^d\), it is manifold, thus any \( d-1\)-face belongs to exactly two \( d\)-dimensional full cells
|oCFullCellThe concept TriangulationDataStructure::FullCell describes the type used by a TriangulationDataStructure to store the full cells
|\CVertexThe concept TriangulationDataStructure::Vertex describes the type used by a TriangulationDataStructure to store the vertices
oCTriangulationDSFaceA TriangulationDSFace describes a face f with dimension k (a k-face) in a triangulation. It gives access to a handle to a full cell c containing the face f in its boundary, as well as the indices of the vertices of f in c. It must hold that f is a proper face of full cell c, i.e., the dimension of f is strictly less than the dimension of c. The dimension of a face is implicitely set when TriangulationDSFace::set_index is called. For example, if TriangulationDSFace::set_index is called two times to set the first two vertices (i = 0 and i = 1), then the dimension is 1
oCTriangulationDSFullCellThe concept TriangulationDSFullCell describes the requirements for the full cell class of a CGAL::Triangulation_data_structure. It refines the concept TriangulationDataStructure::FullCell
oCTriangulationDSVertexThe concept TriangulationDSVertex describes the requirements for the vertex base class of a CGAL::Triangulation_data_structure. It refines the concept TriangulationDataStructure::Vertex
oCTriangulationFullCellThe concept TriangulationFullCell describes the requirements on the type used by the class CGAL::Triangulation<TriangulationTraits_, TriangulationDataStructure_>, and its derived classes, to represent a full cell
oCTriangulationTraitsThis concept describes the geometric types and predicates required to build a triangulation. It corresponds to the first template parameter of the class CGAL::Triangulation<TriangulationTraits_, TriangulationDataStructure_>
\CTriangulationVertexThe concept TriangulationVertex describes the requirements on the type used by the class CGAL::Triangulation<TriangulationTraits_, TriangulationDataStructure_>, and its derived classes, to represent a vertex