CGAL 4.6 - dD Triangulations
|
Classes | |
class | Delaunay_triangulation |
This class is used to maintain the Delaunay triangulation of a set of points in \( \mathbb{R}^D \). More... | |
class | Triangulation |
This class implements triangulations of point sets in dimensions \( d \). More... | |
class | Triangulation_data_structure |
This class is a data structure used for storing a triangulation of dimension \( d\leq D\) (D is the maximal dimension). More... | |
class | Triangulation_ds_full_cell |
This class is the default model used for the full cell of the class Triangulation_data_structure . More... | |
class | Triangulation_ds_vertex |
The class Triangulation_ds_vertex serves as the default vertex template parameter in the class Triangulation_data_structure<Dimensionality, TriangulationDSVertex, TriangulationDSFullCell> . More... | |
class | Triangulation_face |
A Triangulation_face is a model of the concept TriangulationDSFace . More... | |
class | Triangulation_full_cell |
The class Triangulation_full_cell is a model of the concept TriangulationFullCell . More... | |
class | Triangulation_vertex |
The class Triangulation_vertex is a model of the concept TriangulationVertex . More... | |