Go to the documentation of this file.
101 const bool writeLinesOnly,
110 const bool leavesOnly,
111 const bool writeLinesOnly,
123 const bool equalBinSize,
150 const bool equalBinSize =
true,
151 const label maxLevel = 3,
152 const label minBinSize = 100
bool pointInside(const point &pt) const
Determine whether a point is inside the bounding boxes.
Standard boundBox with extra functionality for use in octree.
bool overlaps(const boundBox &bbIn) const
const List< treeBoundBox > & boundBoxes() const
Return the bounding boxes making up the tree.
List< treeBoundBox > boundBoxes_
Bounding boxes making up the tree.
Istream & operator>>(Istream &, directionInfo &)
void writeOBJ(const bool writeLinesOnly, const treeBoundBox &bb, label &vertI, Ostream &os) const
Write OBJ file of bounding box.
Ostream & operator<<(Ostream &, const boundaryPatch &p)
Write boundaryPatch as dictionary entries (without surrounding braces)
An Istream is an abstract base class for all input systems (streams, files, token lists etc)....
AABBTree()
Null constructor.
label maxLevel_
Maximum tree level.
OBJstream os(runTime.globalPath()/outputName)
static scalar tolerance_
Tolerance.
An ordered pair of two objects of type <T> with first() and second() elements.
const List< labelList > & addressing() const
Return the contents addressing.
Templated tree of axis-aligned bounding boxes (AABB)
void createBoxes(const bool equalBinSize, const label level, const List< Type > &objects, const pointField &points, const DynamicList< label > &objectIDs, const treeBoundBox &bb, const label nodeI, DynamicList< Pair< treeBoundBox >> &bbs, DynamicList< labelPair > &nodes, DynamicList< labelList > &addressing) const
Create the bounding boxes by interrogating points.
A bounding box defined in terms of min/max extrema points.
label minLeafSize_
Minimum points per leaf.
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
List< labelList > addressing_
Leaf addressing.