bb() const | treeElem | [inline] |
bb() | treeElem | [inline] |
distribute(const label, octree< Type > &, const Type &shapes, const labelList &) | treeNode | |
find(const Type &shapes, const point &sample) const | treeNode | |
findBox(const Type &shapes, const boundBox &bb, labelHashSet &elements) const | treeNode | |
findLeafLine(const label level, const Type &shapes, point &start, const point &end) const | treeNode | |
findLeaves(List< treeLeaf< Type > * > &leafArray, label &leafIndex) const | treeNode | |
findLeaves(List< const treeLeaf< Type > * > &leafArray, label &leafIndex) const | treeNode | |
findNearest(const Type &shapes, const point &sample, treeBoundBox &tightest, label &tightesti, scalar &tightestDist) const | treeNode | |
findNearest(const Type &shapes, const linePointRef &ln, treeBoundBox &tightest, label &tightesti, point &linePoint, point &shapePoint) const | treeNode | |
findTightest(const Type &shapes, const point &sample, treeBoundBox &tightest) const | treeNode | |
getLeafPtr(const label octant) const | treeNode | [inline] |
getNodePtr(const label octant) const | treeNode | [inline] |
getSampleType(const label level, const octree< Type > &top, const Type &shapes, const point &sample) const | treeNode | |
isNode(const label octant) const | treeNode | [inline] |
mid() const | treeNode | [inline] |
operator(Ostream &, const treeNode< Type > &) | treeNode | [friend] |
operator>>(Istream &, treeNode< Type > &) | treeNode | [friend] |
printNode(Ostream &os, const label level) const | treeNode | |
redistribute(const label, octree< Type > &, const Type &shapes, const label) | treeNode | |
setSubNodeType(const label level, octree< Type > &top, const Type &shapes) | treeNode | |
subNodes() const | treeNode | [inline] |
treeElem(const treeBoundBox &bb) | treeElem | [inline] |
treeNode(const treeBoundBox &bb) | treeNode | |
treeNode(Istream &) | treeNode | |
writeOBJ(Ostream &os, const label level, label &vertNo) const | treeNode | |
~treeNode() | treeNode | |