CGAL 6.1.1 - 3D Simplicial Mesh Data Structures

Loading...
Searching...
No Matches
Classes
Concepts
Reference Manual

##

The main concepts of this package.

## Concepts
concept | MeshComplex_3InTriangulation_3
| The concept `MeshComplex_3InTriangulation_3` describes a data structure to represent and maintain a 3D complex embedded in a 3D triangulation. More precisely, the concept `MeshComplex_3InTriangulation_3` is a minimal version designed to represent 3D complexes that have only faces with dimension \( 2\) and \( 3\). Embedded 3D complexes with faces of dimension \( 0\), \( 1\), \( 2\) and \( 3\), are more conveniently represented by the refined concept `MeshComplexWithFeatures_3InTriangulation_3`. More...
concept | MeshComplexWithFeatures_3InTriangulation_3
| The concept `MeshComplexWithFeatures_3InTriangulation_3` describes a data structure to represent and maintain a 3D complex embedded in a 3D triangulation. The concept `MeshComplexWithFeatures_3InTriangulation_3` refines the minimal concept `MeshComplex_3InTriangulation_3`, designed to represent 3D complexes having only faces with dimension 2 and 3. Therefore, the concept `MeshComplexWithFeatures_3InTriangulation_3` may represent embedded complexes including features, i.e. faces with dimension \( 0\) and \( 1\). More...
concept | SimplicialMeshCellBase_3
| The concept `SimplicialMeshCellBase_3` describes the requirements for the `TriangulationDataStructure_3::Cell` type of the triangulation used in a 3D simplicial mesh data structure. More...
concept | SimplicialMeshVertexBase_3
| The concept `SimplicialMeshVertexBase_3` describes the requirements for the `Vertex` type of the triangulation used in a 3D simplicial mesh data structure. The type `SimplicialMeshVertexBase_3` refines the concept `TriangulationVertexBase_3`. It provides additional members to store and retrieve information about the location of the vertex with respect to the input domain describing the discretized domain. More specifically, the concept `SimplicialMeshVertexBase_3` provides read-write access to an integer representing the dimension of the lowest dimensional face of the input 3D complex on which the vertex lies, and to an index characteristic of this face. More...