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.
The data structure includes a 3D triangulation which is itself a 3D complex. To distinguish the faces of the embedded 3D complex from the faces of the triangulation, we call the faces of the embedded complex respectively subdomains, for 3D faces and surface patches, for 2D faces, while the triangulations faces are called respectively cells, facets, edges and vertices.
Each subdomain of the embedded 3D complex is a union of triangulation cells. Cells that belong to some subdomain are said to belong to the embedded complex. Each surface patch is a union of triangulation facets. Triangulation facets that belong to some surface patch are called surface facets. The concept MeshComplex_3InTriangulation_3 handles the marking and retrieval of the cells of the triangulation belonging to the subdomains and of the facets of the triangulation belonging to the surface patches. The concept MeshComplex_3InTriangulation_3 also includes an index type for vertices of the triangulation and attaches an integer, called the dimension to each vertex. When used by the meshing algorithm, the index and the dimension of each vertex are used to store respectively the lowest dimensional face of the input complex including the vertex and the dimension of this face.
In the 3D mesh generator, the concept MeshComplex_3InTriangulation_3 is used when the domain to be meshed has no feature with dimension 0 and 1. Such a data structure is used internally by the mesh generator to maintain the current approximation of each subdomain and each boundary surface patch. The data structure encodes the final mesh at the end of the meshing process.
| |
Type of the
embedding 3D triangulation.
This type must be a 3D
regular triangulation of Cgal when used for 3D mesh generation.
|
| |
A type for indices of subdomains.
This type must match the type MeshDomain_3::Subdomain_index
when the concept is used for mesh generation.
| |
| |
A type for indices of surface patches.
This type must match the type MeshDomain_3::Surface_patch_index
when the concept is used for mesh generation.
| |
| |
A type for indexing vertices that belong to some surface patches
or subdomains.
This type must match the type MeshDomain_3::Index
when the concept is used for mesh generation.
| |
| |
An iterator type to visit the cells
of the triangulation belonging to the 3D complex.
| |
| |
An iterator type to visit the surface facets.
|
| |
Builds an empty 3D complex.
| |
| |
Copy constructor. Embedded triangulation is duplicated.
|
|
| Assignment operator. Embedded triangulation is duplicated, and the former triangulation of rhs is deleted. |
|
| Swaps c3t3 and rhs. |
|
| Returns a const reference to the triangulation. |
|
| Returns a reference to the triangulation. |
|
| |
Sets the cell c as a cell of the subdomain index. | ||
|
| |
Adds the facet f as a facet of the surface patch index.) | ||
|
| |
Same as above with f=(c,i). | ||
|
| |
Removes cell c from the embedded complex. | ||
|
| |
Removes facet f from the embedded complex. | ||
|
| |
Same as above with f=(c,i). | ||
|
| |
Sets the ``dimension'' of vertex v. The dimension is an integer attached to the vertex. When the concept MeshComplex_3InTriangulation_3 is used for mesh generation this integer is used to store the dimension of the lowest dimensional face of the input complex including the vertex. | ||
|
| |
Sets the index of a vertex. |
|
| Returns the number of cells that belong to the embedded complex. |
|
| |
Returns the number of cells that belong to the subdomain of the embedded complex with index index. | ||
|
| Returns the number of facets that are surface facets, i. e. belong to some surface patch of the embedded complex. |
|
| |
Returns the number of facets that belong to the surface patch of the embedded complex with index index. | ||
|
| |
Returns true iff the cell c belongs to the 3D complex. | ||
|
| Returns true iff the facet f belongs to the boundary 2D complex. |
|
| |
Same as above with f=(c,i). |
Queries on the identifier of the face complex including triangulation cells, facets and vertices.
|
| |
Returns the index of the subdomain containing the cell c. The default subdomain index is returned if the cell c does not belong to the embedded complex. | ||
|
| |
For a surface facet, returns the index of the surface patch containing the facet. The default Surface_patch_index value is returned if the facet is not a surface facet. | ||
|
| |
Same as above with f=(c,i). | ||
|
| |
Returns the dimension of the vertex v. | ||
|
| |
Returns the index of the vertex v. |
The data structure provides iterators to visit the cells and facets of the complex. All those iterators are bidirectional and non mutable.