Go to the documentation of this file.
47 const labelList& owner = this->faceOwner();
58 if (owner[nFace] != celli)
62 inCell = inCell && ((
normal & proj) <= 0);
74 label nearestCelli = 0;
75 scalar minProximity =
magSqr(centres[0] - location);
77 for (
label celli = 1; celli < centres.size(); celli++)
79 scalar proximity =
magSqr(centres[celli] - location);
81 if (proximity < minProximity)
84 minProximity = proximity;
101 label celli = findNearestCell(location);
104 if (pointInCell(location, celli))
110 bool cellFound =
false;
113 while ((!cellFound) && (
n < nCells()))
115 if (pointInCell(location,
n))
virtual const pointField & points() const =0
Return mesh points.
#define forAll(list, i)
Loop across all elements in list.
virtual const faceList & faces() const =0
Return faces.
const cellList & cells() const
bool pointInCell(const point &p, label celli) const
Is the point in the cell.
label findNearestCell(const point &location) const
Find the cell with the nearest cell centre to location.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
Pre-declare SubField and related Field type.
label findCell(const point &location) const
Find cell enclosing this location (-1 if not in mesh)
bool contains(const point &) const
Contains point? (inside or on edge)
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
A bounding box defined in terms of the points at its extremities.
bool pointInCellBB(const point &p, label celli) const
Is the point in the cell bounding box.
dimensioned< scalar > magSqr(const dimensioned< Type > &)
A normal distribution model.