
concept  TriangulationDataStructure_3 
 3Dtriangulation data structures are meant to maintain the combinatorial information for 3Dgeometric triangulations. More...


concept  TriangulationDataStructure_3::Cell_data 
 Various algorithms using a triangulation data structure, such as Delaunay triangulations or Alpha Shapes, must be able to associate a state to a cell elemental. For efficiency, this information must be stored directly within the cell. More...


concept  TriangulationDataStructure_3::Cell 
 The concept TriangulationDataStructure_3::Cell stores four Vertex_handle s to its four vertices and four Cell_handle s to its four neighbors. The vertices are indexed 0, 1, 2, and 3 in consistent order. The neighbor indexed \( i\) lies opposite to vertex i . More...


concept  TriangulationDataStructure_3::Vertex 
 The concept TriangulationDataStructure_3::Vertex represents the vertex class of a 3Dtriangulation data structure. It must define the types and operations listed in this section. Some of these requirements are of geometric nature, they are optional when using the triangulation data structure class alone. They become compulsory when the triangulation data structure is used as a layer for the geometric triangulation class. (See Section Software Design.) More...


concept  TriangulationDSCellBase_3 

concept  TriangulationDSVertexBase_3 
