Concepts

Concepts
concept	DelaunayTriangulationTraits
	The concept DelaunayTriangulationTraits is the first template parameter of the class Delaunay_triangulation<DelaunayTriangulationTraits, TriangulationDataStructure>. It brings the geometric ingredients to the definition of a Delaunay complex, while the combinatorial ingredients are brought by the second template parameter, TriangulationDataStructure. More...
concept	FullCellData
	More...
concept	TriangulationDataStructure
	The TriangulationDataStructure concept describes objects responsible for storing and maintaining the combinatorial part of a \( d\)-dimensional pure simplicial complex that has the topology of the \( d\)-dimensional sphere \( \mathcal S^d\) with \( d\in[-2,D]\). Since the simplicial \( d\)-complex is pure, all faces are sub-faces of some \( d\)-simplex. And since it has the topology of the sphere \( \mathcal S^d\), it is manifold, thus any \( d-1\)-face belongs to exactly two \( d\)-dimensional full cells. More...
concept	TriangulationDSFace
	A TriangulationDSFace describes a face f with dimension k (a k-face) in a triangulation. It gives access to a handle to a full cell c containing the face f in its boundary, as well as the indices of the vertices of f in c. It must hold that f is a proper face of full cell c, i.e., the dimension of f is strictly less than the dimension of c. . More...
concept	TriangulationDSFullCell
	The concept TriangulationDSFullCell describes what a full cell is in a model of the concept TriangulationDataStructure. It sets requirements of combinatorial nature only, as geometry is not concerned here. In the context of triangulation, the term full cell refers to a face of maximal dimension. This maximality characteristic is emphasized by using the adjective full. More...
concept	TriangulationDSVertex
	The concept TriangulationDSVertex describes what a vertex is in a model of the concept TriangulationDataStructure. It sets requirements of combinatorial nature only, as geometry is not concerned here. In particular, we only require that the vertex holds a handle to a full cell incident to it in the triangulation. More...
concept	TriangulationFullCell
	The concept TriangulationFullCell describes the requirements on the type used by the class Triangulation<TriangulationTraits, TriangulationDataStructure>, and its derived classes, to represent a full cell. More...
concept	TriangulationTraits
	The concept TriangulationTraits is the first template parameter of the class Triangulation<TriangulationTraits, TriangulationDataStructure>. It brings the geometric ingredient to the definition of a triangulation, while the combinatorial ingredient is brought by the second template parameter, TriangulationDataStructure. More...
concept	TriangulationVertex
	The concept TriangulationVertex describes the requirements on the type used by the class Triangulation<TriangulationTraits, TriangulationDataStructure>, and its derived classes, to represent a vertex. More...