Go to the documentation of this file.
87 patchNames_(
mesh.boundaries().size()),
88 patchTypes_(
mesh.boundaries().size()),
91 newBoundaryPatches_(),
92 decomposeCell_(mesh_.
cells().size(), false),
98 patchNames_[patchI] = boundaries[patchI].patchName();
99 patchTypes_[patchI] = boundaries[patchI].patchType();
VRWGraph newBoundaryFaces_
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.
const meshSurfaceEngine * msePtr_
pointer to surface engine
void replaceBoundary(const wordList &patchNames, const VRWGraph &boundaryFaces, const labelLongList &faceOwners, const labelLongList &facePatches)
replace the boundary with new boundary faces
labelLongList newBoundaryPatches_
boolList decomposeCell_
holds data which cells have to be decomposed
correctEdgesBetweenPatches(const correctEdgesBetweenPatches &)
Disallow default bitwise copy construct.
void deleteDemandDrivenData(DataPtr &dataPtr)
void decomposeCorrectedCells()
decompose corrected cells
void clearMeshSurface()
delete mesh surface
void decomposeConcaveFaces()
decompose cells with faces at concave boundary edges
A templated 1D list of pointers to objects of type <T>, where the size of the array is known and used...
wordList patchNames_
boundary data
~correctEdgesBetweenPatches()
const meshSurfaceEngine & meshSurface() const
construct and return mesh surface
void replaceBoundary()
replace boundary
const PtrList< boundaryPatch > & boundaries() const
ordinary boundaries
labelLongList newBoundaryOwners_
void patchCorrection()
perform decompose remaining faces having more than one feature edge