Go to the documentation of this file.
38 #ifndef treeDataEdge_H
39 #define treeDataEdge_H
107 scalar& nearestDistSqr,
138 point& intersectionPoint
191 return edgeLabels_.size();
221 const scalar radiusSqr
findNearestOp(const indexedOctree< treeDataEdge > &tree)
volumeType getVolumeType(const indexedOctree< treeDataEdge > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
treeDataEdge(const bool cacheBb, const edgeList &edges, const pointField &points, const labelUList &edgeLabels)
Construct from selected edges.
Standard boundBox with extra functionality for use in octree.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
findIntersectOp(const indexedOctree< treeDataEdge > &tree)
An enumeration wrapper for classification of a location as being inside/outside of a volume.
const edgeList & edges() const
Non-pointer based hierarchical recursive searching.
Holds data for octree to work on an edges subset.
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
const pointField & points() const
pointField shapePoints() const
ClassName("treeDataEdge")
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
const labelList & edgeLabels() const
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: