40 #ifndef dynamicTreeDataPoint_H 41 #define dynamicTreeDataPoint_H 54 template<
class Type>
class dynamicIndexedOctree;
84 return points_.
size();
114 const scalar radiusSqr
124 scalar& nearestDistSqr,
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
ClassName("dynamicTreeDataPoint")
const DynamicList< point > & shapePoints() const
Get representative point cloud for all shapes inside.
void size(const label)
Override size to be inconsistent with allocated storage.
dynamicTreeDataPoint(const DynamicList< point > &points)
Construct from List. Holds reference!
A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects...
Non-pointer based hierarchical recursive searching. Storage is dynamic, so elements can be deleted...
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
bool ln(const fileName &src, const fileName &dst)
Create a softlink. dst should not exist. Returns true if successful.
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. Used for searching for nearest point. No bounding boxes around points. Only overlaps and calcNearest are implemented, rest makes little sense.
void findNearest(const labelUList &indices, const point &sample, scalar &nearestDistSqr, label &nearestIndex, point &nearestPoint) const
Calculates nearest (to sample) point in shape.
volumeType getVolumeType(const dynamicIndexedOctree< dynamicTreeDataPoint > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
Standard boundBox + extra functionality for use in octree.
#define NotImplemented
Issue a FatalErrorIn for a function not currently implemented.