Processing math: 100%
CGAL 4.5 - 2D Triangulation Data Structure
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages

Concepts

conceptTriangulationDataStructure_2
 The concept TriangulationDataStructure_2 describes the requirements for the second template parameter of the basic triangulation class Triangulation_2<Traits,Tds> and of all other 2D triangulation classes. More...
 
conceptTriangulationDataStructure_2::Vertex
 The concept TriangulationDataStructure_2::Vertex describes the type used by a TriangulationDataStructure_2 to store the vertices. More...
 
conceptTriangulationDataStructure_2::Face
 The concept TriangulationDataStructure_2::Face describes the types used to store the faces face class of a TriangulationDataStructure_2. A TriangulationDataStructure_2::Face stores three handles to its three vertices and three handles to its three neighbors. The vertices are indexed 0,1, and 2 in counterclockwise order. The neighbor indexed i lies opposite to vertex i. More...
 
conceptTriangulationDSFaceBase_2
 The concept TriangulationDSFaceBase_2 describes the requirements for the base face of a CGAL::Triangulation_data_structure_2<Vb,Fb>. More...
 
conceptTriangulationDSVertexBase_2
 The concept TriangulationDSVertexBase_2 describes the requirements for the vertex base class of a Triangulation_data_structure_2<Vb,Fb>. More...