bb() const | treeElem | [inline] |
bb() | treeElem | [inline] |
countLeaf(Ostream &, const label) const | treeLeaf | |
find(const Type &shapes, const point &sample) const | treeLeaf | |
find(const octreeDataPoint &shapes, const point &sample) const | treeLeaf | |
findBox(const Type &shapes, const boundBox &bb, labelHashSet &elements) const | treeLeaf | |
findNearest(const Type &shapes, const point &sample, treeBoundBox &tightest, label &tightesti, scalar &tightestDist) const | treeLeaf | |
findNearest(const Type &shapes, const linePointRef &ln, treeBoundBox &tightest, label &tightesti, point &linePoint, point &shapePoint) const | treeLeaf | |
findNearest(const octreeDataPoint &shapes, const point &sample, treeBoundBox &tightest, label &tightesti, scalar &tightestDist) const | treeLeaf | |
findNearest(const octreeDataTriSurface &shapes, const point &sample, treeBoundBox &tightest, label &tightesti, scalar &tightestDist) const | treeLeaf | |
findTightest(const Type &shapes, const point &sample, treeBoundBox &tightest) const | treeLeaf | |
getSampleType(const label level, const octree< Type > &top, const Type &shapes, const point &sample) const | treeLeaf | |
indices() const | treeLeaf | [inline] |
insert(const label index) | treeLeaf | [inline] |
operator(Ostream &, const treeLeaf< Type > &) | treeLeaf | [friend] |
operator>>(Istream &, treeLeaf< Type > &) | treeLeaf | [friend] |
printLeaf(Ostream &, const label) const | treeLeaf | |
redistribute(const label, octree< Type > &, const Type &) | treeLeaf | |
setSubNodeType(const label level, octree< Type > &top, const Type &shapes) const | treeLeaf | |
size() const | treeLeaf | [inline] |
treeElem(const treeBoundBox &bb) | treeElem | [inline] |
treeLeaf(const treeBoundBox &bb, const label size) | treeLeaf | |
treeLeaf(const treeBoundBox &bb, const labelList &indices) | treeLeaf | |
treeLeaf(Istream &) | treeLeaf | |
trim() | treeLeaf | [inline] |
writeOBJ(Ostream &os, const label level, label &vertNo) const | treeLeaf | |
~treeLeaf() | treeLeaf | |