|
CGAL 6.0 - 2D Triangulation Data Structure
|
| ▼NCGAL | |
| CTriangulation_data_structure_2 | The class Triangulation_data_structure_2 is a model for the TriangulationDataStructure_2 concept |
| CTriangulation_ds_face_base_2 | The class Triangulation_ds_face_base_2 is a model for the concept TriangulationDSFaceBase_2 to be used by Triangulation_data_structure_2 |
| CTriangulation_ds_vertex_base_2 | The class Triangulation_ds_vertex_base_2 can be used as the base vertex for a Triangulation_data_structure_2, it is a model of the concept TriangulationDSVertexBase_2 |
| ▼CTriangulationDataStructure_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 |
| CFace | 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 |
| CFace_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 |
| CVertex | The concept TriangulationDataStructure_2::Vertex describes the type used by a TriangulationDataStructure_2 to store the vertices |
| CTriangulationDSFaceBase_2 | |
| CTriangulationDSVertexBase_2 |