35 #ifndef treeDataEdge_H
36 #define treeDataEdge_H
48 template<
class Type>
class indexedOctree;
104 scalar& nearestDistSqr,
135 point& intersectionPoint
187 return edgeLabels_.
size();
217 const scalar radiusSqr
void size(const label)
Override size to be inconsistent with allocated storage.
Non-pointer based hierarchical recursive searching.
Standard boundBox + extra functionality for use in octree.
findIntersectOp(const indexedOctree< treeDataEdge > &tree)
findNearestOp(const indexedOctree< treeDataEdge > &tree)
Holds data for octree to work on an edges subset.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
ClassName("treeDataEdge")
const labelList & edgeLabels() const
treeDataEdge(const bool cacheBb, const edgeList &edges, const pointField &points, const labelUList &edgeLabels)
Construct from selected edges. !Holds references to edges and points.
const edgeList & edges() const
volumeType getVolumeType(const indexedOctree< treeDataEdge > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
pointField shapePoints() const
Get representative point cloud for all shapes inside.
const pointField & points() const
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
bool ln(const fileName &src, const fileName &dst)
Create a softlink. dst should not exist. Returns true if successful.