51 face& vertexLabels = curFaces[faceI];
53 bool duplicatesFound =
false;
57 label curLabel = vertexLabels[vI];
61 forAll(vertexLabels, searchI)
63 if (vertexLabels[searchI] == curLabel)
71 duplicatesFound =
true;
89 face newFace(vertexLabels.size());
91 label nNewVertices = 0;
100 label curLabel = vertexLabels[vI];
106 for (
label searchI = 0; searchI < nNewVertices; searchI++)
108 if (newFace[searchI] == curLabel)
118 newFace[nNewVertices] = curLabel;
123 newFace.setSize(nNewVertices);
129 if (nNewVertices < 3)
132 <<
"face " << faceI <<
" of cell " << cellI
133 <<
" is colapsed down to a point or edge, which is "
134 <<
"not permitted" <<
endl
135 <<
"original face: " << vertexLabels <<
endl
136 <<
"purged face: " << newFace <<
endl
141 vertexLabels = newFace;