CGAL 4.7 - 3D Triangulations: Class and Concept List

\( \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 - 3D 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]

CGAL |
Delaunay_triangulation_3 | The class `Delaunay_triangulation_3` represents a three-dimensional Delaunay triangulation
Delaunay_triangulation_cell_base_3 | The class `Delaunay_triangulation_cell_base_3` is a model of the concept `DelaunayTriangulationCellBase_3`
Delaunay_triangulation_cell_base_with_circumcenter_3 | The class `Delaunay_triangulation_cell_base_with_circumcenter_3` derives from `Cb`, a cell base class of a 3D triangulation
Regular_triangulation_3 | Let \( {S}^{(w)}\) be a set of weighted points in \( \mathbb{R}^3\)
Regular_triangulation_cell_base_3 | The class `Regular_triangulation_cell_base_with_weighted_circumcenter_3` derives from `Cb`, a cell base class of a 3D triangulation
Regular_triangulation_cell_base_with_weighted_circumcenter_3 | The class `Regular_triangulation_cell_base_with_weighted_circumcenter_3` derives from `Cb`, a cell base class of a 3D triangulation
Regular_triangulation_euclidean_traits_3 | The class `Regular_triangulation_euclidean_traits_3` is designed as a default traits class for the class `Regular_triangulation_3<RegularTriangulationTraits_3,TriangulationDataStructure_3>`
Regular_triangulation_filtered_traits_3 |
Triangulation_3 | The class `Triangulation_3` represents a 3-dimensional tetrahedralization of points
Triangulation_cell_base_3 | The class `Triangulation_cell_base_3` is a model of the concept `TriangulationCellBase_3`, the base cell of a 3D-triangulation
Triangulation_cell_base_with_circumcenter_3 |
Triangulation_cell_base_with_info_3 | The class `Triangulation_cell_base_with_info_3` is a model of the concept `TriangulationCellBase_3`, the base cell of a 3D-triangulation
Triangulation_simplex_3 | The class `Triangulation_simplex_3` stores a simplex of any dimension defined by the `Triangulation_3` class
Triangulation_vertex_base_3 | The class `Triangulation_vertex_base_3` is a model of the concept `TriangulationVertexBase_3`, the base vertex of a 3D-triangulation
Triangulation_vertex_base_with_info_3 | The class `Triangulation_vertex_base_with_info_3` is a model of the concept `TriangulationVertexBase_3`, the base vertex of a 3D-triangulation
DelaunayTriangulationCellBase_3 | The base cell of a Delaunay triangulation has to be a model of the concept `DelaunayTriangulationCellBase_3`, which refines the concept `TriangulationCellBase_3` by adding in the cell an operator that computes its circumcenter
DelaunayTriangulationTraits_3 | The concept `DelaunayTriangulationTraits_3` is the first template parameter of the class `Delaunay_triangulation_3`. It defines the geometric objects (points, segments...) forming the triangulation together with a few geometric predicates and constructions on these objects
RegularTriangulationCellBase_3 | The regular triangulation of a set of weighted points does not necessarily have one vertex for each of the input points. Some of the input weighted points have no cell in the dual power diagrams and therefore do not correspond to a vertex of the regular triangulation. Those weighted points are said to be hidden points. A point which is hidden at a given time may appear later as a vertex of the regular triangulation upon removal on some other weighted point. Therefore, hidden points have to be stored somewhere. The regular triangulation stores those hidden points in its cells
RegularTriangulationTraits_3 | The concept `RegularTriangulationTraits_3` is the first template parameter of the class `Regular_triangulation_3`. It defines the geometric objects (points, segments...) forming the triangulation together with a few geometric predicates and constructions on these objects
TriangulationCellBase_3 | The cell base required by the basic triangulation does not need to store any geometric information, so only the requirements of the triangulation data structure apply
TriangulationCellBaseWithInfo_3 | A type model of this concept can be used as cell base by a triangulation and provides an additional information storage
TriangulationTraits_3 | The concept `TriangulationTraits_3` is the first template parameter of the class `Triangulation_3`. It defines the geometric objects (points, segments, triangles and tetrahedra) forming the triangulation together with a few geometric predicates and constructions on these objects : lexicographical comparison, orientation in case of coplanar points and orientation in space
TriangulationVertexBase_3 | The vertex base used by the geometric triangulation must store a point. So we list here the additional requirements compared to a vertex base usable for the triangulation data structure
TriangulationVertexBaseWithInfo_3 | A type model of this concept can be used as vertex base by a triangulation and provides an additional information storage
WeightedPoint |