Go to the documentation of this file.
52 ortho[facei] = primitiveMeshTools::faceOrthogonality
64 syncTools::swapBoundaryCellPositions(
mesh, cc, neighbourCc);
73 label facei = pp.
start() + i;
74 label bFacei = facei -
mesh.nInternalFaces();
76 ortho[facei] = primitiveMeshTools::faceOrthogonality
108 skew[facei] = primitiveMeshTools::faceSkewness
116 cellCtrs[own[facei]],
126 syncTools::swapBoundaryCellPositions(
mesh, cellCtrs, neighbourCc);
135 label facei = pp.
start() + i;
136 label bFacei = facei -
mesh.nInternalFaces();
138 skew[facei] = primitiveMeshTools::faceSkewness
146 cellCtrs[own[facei]],
155 label facei = pp.
start() + i;
157 skew[facei] = primitiveMeshTools::boundaryFaceSkewness
193 const point& fc = fCtrs[facei];
194 const vector& fa = fAreas[facei];
196 scalar dOwn =
mag(fa & (fc-cellCtrs[own[facei]]));
197 scalar dNei =
mag(fa & (cellCtrs[nei[facei]]-fc));
199 weight[facei] =
min(dNei,dOwn)/(dNei+dOwn+VSMALL);
206 syncTools::swapBoundaryCellPositions(
mesh, cellCtrs, neiCc);
215 label facei = pp.
start() + i;
216 label bFacei = facei -
mesh.nInternalFaces();
218 const point& fc = fCtrs[facei];
219 const vector& fa = fAreas[facei];
221 scalar dOwn =
mag(fa & (fc-cellCtrs[own[facei]]));
222 scalar dNei =
mag(fa & (neiCc[bFacei]-fc));
224 weight[facei] =
min(dNei,dOwn)/(dNei+dOwn+VSMALL);
249 scalar volOwn = vol[own[facei]];
250 scalar volNei = vol[nei[facei]];
252 ratio[facei] =
min(volOwn,volNei)/(
max(volOwn, volNei)+VSMALL);
259 syncTools::swapBoundaryCellList(
mesh, vol, neiVol);
268 label facei = pp.
start() + i;
269 label bFacei = facei -
mesh.nInternalFaces();
271 scalar volOwn = vol[own[facei]];
272 scalar volNei = neiVol[bFacei];
274 ratio[facei] =
min(volOwn,volNei)/(
max(volOwn, volNei)+VSMALL);
Field< scalar > scalarField
Specialisation of Field<T> for scalar.
dimensionedTensor skew(const dimensionedTensor &dt)
A polyBoundaryMesh is a polyPatch list with additional search methods and registered IO.
A class for managing temporary objects.
virtual bool coupled() const
Return true if this patch is geometrically coupled (i.e. faces and.
label min(const labelHashSet &set, label minValue=labelMax)
Find the min value in labelHashSet, optionally limited by second argument.
Mesh consisting of general polyhedral cells.
#define forAll(list, i)
Loop across all elements in list.
A patch is a list of labels that address the faces in the global face list.
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
label start() const
Return start label of this patch in the polyMesh face list.
dimensioned< typename typeOfMag< Type >::type > mag(const dimensioned< Type > &dt)