56 scalar nearestHitDist = GREAT;
58 scalar nearestMissDist = GREAT;
59 bool eligible =
false;
68 point nextPoint = ctr;
70 for (label pI = 0; pI <
nPoints; pI++)
72 nextPoint = meshPoints[f[fcIndex(pI)]];
81 ).ray(p, n, alg, dir);
92 else if (!nearest.
hit())
108 if (missDist < nearestMissDist)
110 nearestMissDist = missDist;
142 scalar nearestHitDist = VGREAT;
155 meshPoints[f[fcIndex(pI)]],
157 ).intersection(p, q, alg, tol);
185 const face&
f = *
this;
186 point ctr = centre(meshPoints);
193 point nextPoint = ctr;
195 for (label pI = 0; pI <
nPoints; pI++)
197 nextPoint = meshPoints[f[fcIndex(pI)]];
208 pointHit curHit = tri.nearestPoint(p);