CGAL 4.7 - 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::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...

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

conceptTriangulationDSCellBase_3
At the base level (see the Software Design sections of the Chapters Triangulation and Triangulation Datastructure), a cell stores handles to its four vertices and to its four neighbor cells. The vertices and neighbors are indexed 0, 1, 2 and 3. Neighbor i lies opposite to vertex i. More...

conceptTriangulationDSVertexBase_3
At the bottom level of 3D-triangulations (see Sections Software Design and Software Design), a vertex provides access to one of its incident cells through a handle. More...