CGAL 4.6.3 - dD Triangulations
|
Classes | |
class | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
This class is used to maintain the Delaunay triangulation of a set of points in \( \mathbb{R}^D \). More... | |
class | CGAL::Triangulation< TriangulationTraits, TriangulationDataStructure > |
This class implements triangulations of point sets in dimensions \( d \). More... | |
class | CGAL::Triangulation_data_structure< Dimensionality, TriangulationDSVertex, TriangulationDSFullCell > |
This class is a data structure used for storing a triangulation of dimension \( d\leq D\) (D is the maximal dimension). More... | |