Go to the documentation of this file.
76 return cubeBb.
contains(points_[index]);
84 const scalar radiusSqr
87 const point&
p = points_[index];
89 const scalar distSqr =
magSqr(
p - centre);
91 if (distSqr <= radiusSqr)
105 scalar& nearestDistSqr,
112 const label index = indices[i];
114 const point& pt = points_[index];
116 scalar distSqr =
magSqr(pt - sample);
118 if (distSqr < nearestDistSqr)
120 nearestDistSqr = distSqr;
140 scalar nearestDistSqr =
magSqr(linePoint - nearestPoint);
144 const label index = indices[i];
146 const point& shapePt = points_[index];
154 if (distSqr < nearestDistSqr)
156 nearestDistSqr = distSqr;
159 nearestPoint = shapePt;
163 minPt =
min(
ln.start(),
ln.end());
170 maxPt =
max(
ln.start(),
ln.end());
const Cmpt & x() const
Access to the vector x component.
Describes the interaction of a face and a point. It carries the info of a successful hit and (if succ...
void findNearest(const labelUList &indices, const point &sample, scalar &nearestDistSqr, label &nearestIndex, point &nearestPoint) const
Calculates nearest (to sample) point in shape.
Standard boundBox with extra functionality for use in octree.
const DynamicList< point > & shapePoints() const
Get representative point cloud for all shapes inside.
scalar distance() const noexcept
Return distance to hit.
const point & max() const
Maximum describing the bounding box.
const Cmpt & z() const
Access to the vector z component.
label min(const labelHashSet &set, label minValue=labelMax)
Find the min value in labelHashSet, optionally limited by second argument.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
const point & min() const
Minimum describing the bounding box.
#define forAll(list, i)
Loop across all elements in list.
dimensioned< typename typeOfMag< Type >::type > magSqr(const dimensioned< Type > &dt)
Non-pointer based hierarchical recursive searching. Storage is dynamic, so elements can be deleted.
An enumeration wrapper for classification of a location as being inside/outside of a volume.
const point_type & rawPoint() const noexcept
The point, no checks.
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
const Cmpt & y() const
Access to the vector y component.
dimensionedSymmTensor sqr(const dimensionedVector &dv)
bool contains(const vector &dir, const point &) const
Contains point (inside or on edge) and moving in direction.
volumeType getVolumeType(const dynamicIndexedOctree< dynamicTreeDataPoint > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
dynamicTreeDataPoint(const DynamicList< point > &points)
Construct from List. Holds reference!
bool ln(const fileName &src, const fileName &dst)
Create a softlink. dst should not exist. Returns true if successful.
defineTypeNameAndDebug(combustionModel, 0)