Go to the documentation of this file.
47 Info <<
"Decomposing split-hex cells" <<
endl;
57 if( faces[faceI].size() > 4 )
61 decompose[faceI] =
true;
67 Info <<
"Decomposing " << nDecomposed
68 <<
" faces with more than 4 vertices" <<
endl;
70 if( nDecomposed != 0 )
87 decompose[cellI] =
true;
93 Info <<
"Decomposing " << nDecomposed
94 <<
" cells into tetrahedra and pyramids" <<
endl;
103 Info <<
"Finished decomposing split-hex cells" <<
endl;
const labelList & owner() const
owner and neighbour cells for faces
void decomposeMesh(const boolList &)
perform decomposition of selected cell into pyramids
#define forAll(list, i)
Loop across all elements in list.
Template functions to aid in the implementation of demand driven data.
Ostream & endl(Ostream &os)
Add newline and flush stream.
const faceListPMG & faces() const
access to faces
void reduce(const List< UPstream::commsStruct > &comms, T &Value, const BinaryOp &bop, const int tag, const label comm)
A cellMatcher for hex cells.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
const cellListPMG & cells() const
access to cells
void decomposeMeshFaces(const boolList &decomposeFace)
decompose selected faces into triangles using midnode subdivision
IOstream & hex(IOstream &io)
void setSize(const label)
Reset size of List.
label size() const
return the number of used elements
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...