|
int | MMG5_paktet (MMG5_pMesh mesh) |
|
int | MMG5_hashFace (MMG5_pMesh mesh, MMG5_Hash *hash, int ia, int ib, int ic, int k) |
|
int | MMG5_hashGetFace (MMG5_Hash *hash, int ia, int ib, int ic) |
|
int | MMG3D_hashTetra (MMG5_pMesh mesh, int pack) |
|
int | MMG3D_hashPrism (MMG5_pMesh mesh) |
|
static int | MMG5_setEdgeNmTag (MMG5_pMesh mesh, MMG5_Hash *hash) |
|
static int | MMG5_setVertexNmTag (MMG5_pMesh mesh) |
|
int | MMG5_setNmTag (MMG5_pMesh mesh, MMG5_Hash *hash) |
|
int | MMG3D_hashTria (MMG5_pMesh mesh, MMG5_Hash *hash) |
|
int | MMG5_hashPop (MMG5_Hash *hash, int a, int b) |
|
int | MMG5_hTag (MMG5_HGeom *hash, int a, int b, int ref, int16_t tag) |
|
int | MMG5_hPop (MMG5_HGeom *hash, int a, int b, int *ref, int16_t *tag) |
|
int | MMG5_hGet (MMG5_HGeom *hash, int a, int b, int *ref, int16_t *tag) |
|
int | MMG5_hEdge (MMG5_pMesh mesh, MMG5_HGeom *hash, int a, int b, int ref, int16_t tag) |
|
int | MMG5_hNew (MMG5_pMesh mesh, MMG5_HGeom *hash, int hsiz, int hmax) |
|
int | MMG5_hGeom (MMG5_pMesh mesh) |
|
static int | MMG5_bdryTria (MMG5_pMesh mesh, int ntmesh) |
|
int | MMG5_chkBdryTria (MMG5_pMesh mesh) |
|
int | MMG5_bdrySet (MMG5_pMesh mesh) |
|
int | MMG5_bdryUpdate (MMG5_pMesh mesh) |
|
int | MMG5_bdryPerm (MMG5_pMesh mesh) |
|
Functions for hash tables management and tetrahedra packing.
- Author
- Charles Dapogny (UPMC)
-
Cécile Dobrzynski (Bx INP/Inria/UBordeaux)
-
Pascal Frey (UPMC)
-
Algiane Froehly (Inria/UBordeaux)
- Version
- 5
- Copyright
- GNU Lesser General Public License.
- Parameters
-
mesh | pointer toward the mesh structure. |
- Returns
- 1 if success, 0 otherwise.
- Remove double triangles from tria array.
- Remove triangles that do not belong to a boundary (non opnbdy mode) from tria array.
- Check the matching between actual and given number of faces in the mesh: Count the number of faces in mesh and compare this number to the number of given triangles.
- If the founded number exceed the given one, add the missing boundary triangles (call to MMG5_bdryTria). Do nothing otherwise.
- Fill the adjacency relationship between prisms and tetra (fill adjapr with a negative value to mark this special faces).
- Set to required the triangles at interface betwen prisms and tet.
Step 1: scan the mesh and count the boundaries
Step 2: detect the extra boundaries (that will be ignored) provided by the user
Step 3: add the missing boundary triangles or, if the mesh contains prisms, set to required the triangles at interface betwen prisms and tet