CGAL 6.0.2 - 2D Triangulation Data Structure

Loading...
Searching...
No Matches
Classes
Concepts
2D Triangulation Data Structure Reference

##

## Concepts
concept | TriangulationDataStructure_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...
concept | TriangulationDataStructure_2::Vertex
| The concept `TriangulationDataStructure_2::Vertex` describes the type used by a `TriangulationDataStructure_2` to store the vertices. More...
concept | TriangulationDataStructure_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...
concept | TriangulationDataStructure_2::Face_data
| Various algorithms using a triangulation data structure, such as Delaunay triangulations or Alpha Shapes, must be able to associate a state to a face elemental. For efficiency, this information must be stored directly within the face. More...
concept | TriangulationDSFaceBase_2
concept | TriangulationDSVertexBase_2