CGAL 6.0.1 - dD Triangulations
Loading...
Searching...
No Matches
CGAL Namespace Reference

Classes

class  Delaunay_triangulation
 This class is used to maintain the Delaunay triangulation of a set of points in \( \mathbb{R}^D \). More...
 
class  Regular_triangulation
 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  Regular_triangulation_traits_adapter
 The class Regular_triangulation_traits_adapter is used internally by the class Regular_triangulation to wrap its first template parameter (RegularTriangulationTraits_) so that the base class Triangulation manipulates weighted points instead of bare points. More...
 
class  Triangulation
 This class implements triangulations of point sets in dimension \( 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...