45 vector(GREAT, GREAT, GREAT),
46 vector(-GREAT, -GREAT, -GREAT)
49 const cell& cFaces = cells[cellI];
53 const face&
f = faces[cFaces[cFaceI]];
57 const point&
p = points[f[fp]];
59 cellBb.min() =
min(cellBb.min(),
p);
60 cellBb.max() =
max(cellBb.max(),
p);
78 cellLabels_(cellLabels),
83 bbs_.setSize(cellLabels_.size());
87 bbs_[i] = calcCellBb(cellLabels_[i]);
100 cellLabels_(
identity(mesh_.nCells())),
105 bbs_.setSize(cellLabels_.size());
109 bbs_[i] = calcCellBb(cellLabels_[i]);
123 cc[i] = mesh_.cellCentres()[cellLabels_[i]];
139 return cubeBb.
overlaps(bbs_[index]);
143 return cubeBb.
overlaps(calcCellBb(cellLabels_[index]));
155 scalar& nearestDistSqr,
162 label index = indices[i];
163 label cellI = cellLabels_[index];
164 scalar distSqr =
magSqr(sample - mesh_.cellCentres()[cellI]);
166 if (distSqr < nearestDistSqr)
168 nearestDistSqr = distSqr;
170 nearestPoint = mesh_.cellCentres()[cellI];
181 point& intersectionPoint
197 const treeBoundBox cellBb = calcCellBb(cellLabels_[index]);
213 const cell& cFaces = mesh_.cells()[cellLabels_[index]];
215 const vector dir(end - start);
216 scalar minDistSqr =
magSqr(dir);
221 const face& f = mesh_.faces()[cFaces[i]];
237 intersectionPoint = inter.
hitPoint();