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]

▼NCGAL
CDelaunay_triangulation_3	The class Delaunay_triangulation_3 represents a three-dimensional Delaunay triangulation
CDelaunay_triangulation_cell_base_3	The class Delaunay_triangulation_cell_base_3 is a model of the concept DelaunayTriangulationCellBase_3
CDelaunay_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
CRegular_triangulation_3	Let \( {S}^{(w)}\) be a set of weighted points in \( \mathbb{R}^3\)
CRegular_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
CRegular_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
CRegular_triangulation_euclidean_traits_3
CRegular_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
CRobust_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
CTriangulation_3	The class Triangulation_3 represents a 3-dimensional tetrahedralization of points
CTriangulation_cell_base_3	The class Triangulation_cell_base_3 is a model of the concept TriangulationCellBase_3, the base cell of a 3D-triangulation
CTriangulation_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
CTriangulation_simplex_3	The class Triangulation_simplex_3 stores a simplex of any dimension defined by the Triangulation_3 class
CTriangulation_vertex_base_3	The class Triangulation_vertex_base_3 is a model of the concept TriangulationVertexBase_3, the base vertex of a 3D-triangulation
CTriangulation_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
CDelaunayTriangulationCellBase_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
CDelaunayTriangulationTraits_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
CRegularTriangulationCellBase_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
CRegularTriangulationCellBaseWithWeightedCircumcenter_3	The concept RegularTriangulationCellBaseWithWeightedCircumcenter_3 refines the concept RegularTriangulationCellBase_3 by caching the weighted circumcenter of the cell
CRegularTriangulationTraits_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
CRegularTriangulationVertexBase_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
CTriangulationCellBase_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
CTriangulationCellBaseWithInfo_3	A type model of this concept can be used as cell base by a triangulation and provides an additional information storage
CTriangulationTraits_3
CTriangulationVertexBase_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
CTriangulationVertexBaseWithInfo_3	A type model of this concept can be used as vertex base by a triangulation and provides an additional information storage
CWeightedPoint