40 #ifndef treeDataPoint_H 41 #define treeDataPoint_H 54 template<
class Type>
class indexedOctree;
69 const bool useSubset_;
87 scalar& nearestDistSqr,
118 point& intersectionPoint
145 ? pointLabels_.
size()
192 const scalar radiusSqr
pointField shapePoints() const
Get representative point cloud for all shapes inside.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
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 size(const label)
Override size to be inconsistent with allocated storage.
ClassName("treeDataPoint")
findNearestOp(const indexedOctree< treeDataPoint > &tree)
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 overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
Non-pointer based hierarchical recursive searching.
Standard boundBox + extra functionality for use in octree.
treeDataPoint(const pointField &)
Construct from pointField. Holds reference!
const pointField & points() const
volumeType getVolumeType(const indexedOctree< treeDataPoint > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
const labelList & pointLabels() const