\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.11.3 - dD Triangulations
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Triangulation Classes
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::Regular_triangulation< RegularTriangulationTraits_, TriangulationDataStructure_ >
 This class is used to maintain the regular triangulation – also known as weighted Delaunay triangulation – of a set of weighted points in \( \mathbb{R}^D \). More...
 
class  CGAL::Triangulation< TriangulationTraits_, TriangulationDataStructure_ >
 This class implements triangulations of point sets in dimension \( 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...