Go to the documentation of this file.
42 #ifndef dynamicTreeDataPoint_H
43 #define dynamicTreeDataPoint_H
56 template<
class Type>
class dynamicIndexedOctree;
84 inline label
size()
const
86 return points_.size();
116 const scalar radiusSqr
126 scalar& nearestDistSqr,
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.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
Non-pointer based hierarchical recursive searching. Storage is dynamic, so elements can be deleted.
bool intersects(const label index, const point &start, const point &end, point &result) const
Calculate intersection of shape with ray. Sets result.
Holds (reference to) pointField. Encapsulation of data needed for octree searches....
#define NotImplemented
Issue a FatalErrorIn for a function not currently implemented.
An enumeration wrapper for classification of a location as being inside/outside of a volume.
ClassName("dynamicTreeDataPoint")
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
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.
Minimal example by using system/controlDict.functions: