CGAL 6.1.1 - 3D Triangulations

Loading...
Searching...
No Matches
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 1 2]

▼N CGAL |
C Delaunay_triangulation_3 | The class `Delaunay_triangulation_3` represents a three-dimensional Delaunay triangulation
C Delaunay_triangulation_cell_base_3 | The class `Delaunay_triangulation_cell_base_3` is a model of the concept `DelaunayTriangulationCellBase_3`
C 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
C Regular_triangulation_3 | Let \( {S}^{(w)}\) be a set of weighted points in \( \mathbb{R}^3\)
C Regular_triangulation_cell_base_3 | The class `Regular_triangulation_cell_base_3` derives from `Cb`, a cell base class of a 3D triangulation
C 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
C Regular_triangulation_euclidean_traits_3 |
C Regular_triangulation_vertex_base_3 | The class `Regular_triangulation_vertex_base_3` is a model of the concept `RegularTriangulationVertexBase_3`, the base vertex of a 3D regular triangulation
C Robust_weighted_circumcenter_filtered_traits_3 | Upgrades the functors models of `Kernel::ConstructWeightedCircumcenter_3`, `Kernel::ComputeSquaredRadius_3`, and `Kernel::ComputeSquaredRadiusSmallestOrthogonalSphere_3` that are provided by `K` with robust versions
C Triangulation_3 | The class `Triangulation_3` represents a 3-dimensional tetrahedralization of points
C 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
C 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
C Triangulation_simplex_3 | The class `Triangulation_simplex_3` stores a simplex of any dimension defined by the `TriangulationDataStructure_3` class
C 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
C 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
C DelaunayTriangulationCellBase_3 | The base cell of a Delaunay triangulation must 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
C DelaunayTriangulationTraits_3 | The concept `DelaunayTriangulationTraits_3` is the first template parameter of the class `CGAL::Delaunay_triangulation_3`. It defines the geometric objects (points, segments...) forming the triangulation together with a few geometric predicates and constructions on these objects
C 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
C RegularTriangulationCellBaseWithWeightedCircumcenter_3 | The concept `RegularTriangulationCellBaseWithWeightedCircumcenter_3` refines the concept `RegularTriangulationCellBase_3` by caching the weighted circumcenter of the cell
C RegularTriangulationTraits_3 | The concept `RegularTriangulationTraits_3` is the first template parameter of the class `CGAL::Regular_triangulation_3`. It defines the geometric objects (points, segments...) forming the triangulation together with a few geometric predicates and constructions on these objects
C RegularTriangulationVertexBase_3 | The base vertex of a regular triangulation must be a model of the concept `RegularTriangulationVertexBase_3`, which refines the concept `TriangulationDSVertexBase_3` by adding a geometric point member
C 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
C TriangulationCellBaseWithInfo_3 | A type model of this concept can be used as cell base by a triangulation and provides an additional information storage
C TriangulationTraits_3 |
C TriangulationVertexBase_3 | The vertex base used by the geometric triangulation must store a point. We list here the additional requirements compared to a vertex base usable for the triangulation data structure
C TriangulationVertexBaseWithInfo_3 | A type model of this concept can be used as vertex base by a triangulation and provides an additional information storage
C WeightedPoint |