CGAL 5.5 - 3D Triangulation Data Structure

## Concepts

conceptTriangulationDataStructure_3
3D-triangulation data structures are meant to maintain the combinatorial information for 3D-geometric triangulations. More...

conceptTriangulationDataStructure_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...

conceptTriangulationDataStructure_3::Cell
The concept TriangulationDataStructure_3::Cell stores four Vertex_handles to its four vertices and four Cell_handles 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...

conceptTriangulationDataStructure_3::Vertex
The concept TriangulationDataStructure_3::Vertex represents the vertex class of a 3D-triangulation 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...

conceptTriangulationDSCellBase_3

conceptTriangulationDSVertexBase_3