36 scalar inflationFraction
49 if (inflationFraction > small)
51 vector inflation = inflationFraction*vector::one*
mag(bb.
span());
52 bb =
boundBox(bb.min() - inflation, bb.
max() + inflation);
68 label nFace = f[facei];
69 vector proj = p - cf[nFace];
71 if (owner[nFace] != celli)
76 if ((normal & proj) > 0)
90 label nearestCelli = 0;
91 scalar minProximity =
magSqr(centres[0] - location);
93 for (
label celli = 1; celli < centres.
size(); celli++)
95 scalar proximity =
magSqr(centres[celli] - location);
97 if (proximity < minProximity)
100 minProximity = proximity;
125 bool cellFound =
false;
128 while ((!cellFound) && (n <
nCells()))
#define forAll(list, i)
Loop across all elements in list.
label findCell(const point &location) const
Find cell enclosing this location (-1 if not in mesh)
void size(const label)
Override size to be inconsistent with allocated storage.
bool contains(const point &) const
Contains point? (inside or on edge)
A bounding box defined in terms of the points at its extremities.
const cellList & cells() const
bool pointInCell(const point &p, label celli) const
Return true if the point is in the cell.
const vectorField & cellCentres() const
dimensioned< scalar > magSqr(const dimensioned< Type > &)
const vectorField & faceCentres() const
const vectorField & faceAreas() const
label findNearestCell(const point &location) const
Find the cell with the nearest cell centre to location.
vector span() const
The bounding box span (from minimum to maximum)
virtual const labelList & faceOwner() const =0
Face face-owner addressing.
dimensioned< scalar > mag(const dimensioned< Type > &)
bool pointInCellBB(const point &p, label celli, scalar inflationFraction=0) const
Return true if the point in the cell bounding box.