46 maxVert += f[faces[faceI]].
size();
57 p[pointI] = first[pointI];
61 maxVert = first.
size();
66 for (label faceI = 1; faceI < faces.size(); faceI++)
68 const labelList& curFace = f[faces[faceI]];
72 const label curPoint = curFace[pointI];
76 for (
register label checkI = 0; checkI < maxVert; checkI++)
78 if (curPoint == p[checkI])
87 p[maxVert] = curPoint;
113 p[i] = meshPoints[pointLabels[i]];
127 label maxNoEdges = 0;
131 maxNoEdges += f[curFaces[faceI]].nEdges();
139 const edgeList curFaceEdges = f[curFaces[faceI]].edges();
141 forAll (curFaceEdges, faceEdgeI)
143 const edge& curEdge = curFaceEdges[faceEdgeI];
145 bool edgeFound =
false;
147 for (label addedEdgeI = 0; addedEdgeI < nEdges; addedEdgeI++)
149 if (allEdges[addedEdgeI] == curEdge)
160 allEdges[nEdges] = curEdge;
202 scalar a = f[faces[faceI]].mag(p);
203 cEst += f[faces[faceI]].centre(p)*a;
207 cEst /= sumArea + VSMALL;
230 sumVc += pyrVol*pyrCentre;
234 return sumVc/(sumV + VSMALL);
255 scalar nCellFaces = 0;
261 cEst += f[faces[faceI]].centre(p);
293 label curLabel = b[bI];
299 if (a[aI] == curLabel)
318 result = (result && fnd[aI]);