36 scalar inflationFraction
49 if (inflationFraction > small)
62 const labelList& owner = this->faceOwner();
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;
116 label celli = findNearestCell(location);
119 if (pointInCell(location, celli))
125 bool cellFound =
false;
128 while ((!cellFound) && (
n < nCells()))
130 if (pointInCell(location,
n))
#define forAll(list, i)
Loop across all elements in list.
void size(const label)
Override size to be inconsistent with allocated storage.
A bounding box defined in terms of the points at its extremities.
const point & min() const
Minimum point defining the bounding box.
const point & max() const
Maximum point defining the bounding box.
bool contains(const point &) const
Contains point? (inside or on edge)
vector span() const
The bounding box span (from minimum to maximum)
label findNearestCell(const point &location) const
Find the cell with the nearest cell centre to location.
bool pointInCell(const point &p, label celli) const
Return true if the point is in the cell.
virtual const faceList & faces() const =0
Return faces.
bool pointInCellBB(const point &p, label celli, scalar inflationFraction=0) const
Return true if the point in the cell bounding box.
label findCell(const point &location) const
Find cell enclosing this location (-1 if not in mesh)
virtual const pointField & points() const =0
Return mesh points.
const cellList & cells() const
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
dimensioned< scalar > mag(const dimensioned< Type > &)
dimensioned< scalar > magSqr(const dimensioned< Type > &)