35 #ifndef treeDataEdge_H 36 #define treeDataEdge_H 104 scalar& nearestDistSqr,
135 point& intersectionPoint
187 return edgeLabels_.
size();
217 const scalar radiusSqr
A simple container for copying or transferring objects of type <T>.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
void size(const label)
Override size to be inconsistent with allocated storage.
Holds data for octree to work on an edges subset.
volumeType getVolumeType(const indexedOctree< treeDataEdge > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
const edgeList & edges() const
findNearestOp(const indexedOctree< treeDataEdge > &tree)
ClassName("treeDataEdge")
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.
treeDataEdge(const bool cacheBb, const edgeList &edges, const pointField &points, const labelUList &edgeLabels)
Construct from selected edges. !Holds references to edges and points.
const labelList & edgeLabels() const
Non-pointer based hierarchical recursive searching.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
const pointField & points() const
Standard boundBox + extra functionality for use in octree.
pointField shapePoints() const
Get representative point cloud for all shapes inside.