CGAL 4.10 - dD Triangulations
|
A triangulation is a pure manifold simplicial complex. Its faces are simplices such that two of them either do not intersect or share a common face.
The triangulation classes of CGAL are designed to represent triangulations of a set of points \( A\) in \( \mathbb{R}^d\). It can be viewed as a partition of the convex hull of \( A\) into simplices whose vertices are the points of \( A\).
See the User Manual for more details.
TriangulationDataStructure
TriangulationDataStructure::FullCell
TriangulationDataStructure::Vertex
TriangulationDSVertex
TriangulationDSFullCell
TriangulationDSFace
FullCellData
The latter two concepts are also abbreviated respectively as TrVertex
and TrFullCell
.
CGAL::Triangulation_data_structure<Dimensionality, TriangulationDSVertex, TriangulationDSFullCell>
CGAL::Triangulation_ds_vertex<TriangulationDataStructure>
CGAL::Triangulation_ds_full_cell<TriangulationDataStructure, TriangulationDSFullCellStoragePolicy>
CGAL::Triangulation_face<TriangulationDataStructure>
CGAL::Triangulation<TriangulationTraits, TriangulationDataStructure>
CGAL::Delaunay_triangulation<DelaunayTriangulationTraits, TriangulationDataStructure>
CGAL::Triangulation_vertex<TriangulationTraits, Data, TriangulationDSVertex>
CGAL::Triangulation_full_cell<TriangulationTraits, Data, TriangulationDSFullCell>
Modules | |
Concepts | |
Triangulation Classes | |
Vertex, Face and Cell Classes | |