Loading...
Searching...
No Matches
bitpit::SkdNode Member List
This is the complete list of members for bitpit::SkdNode, including all inherited members.
| boxContainsPoint(const std::array< double, 3 > &point, double offset) const | bitpit::SkdBox | |
| boxIntersectsSphere(const std::array< double, 3 > ¢er, double radius) const | bitpit::SkdBox | |
| CHILD_BEGIN enum value (defined in bitpit::SkdNode) | bitpit::SkdNode | |
| CHILD_END enum value (defined in bitpit::SkdNode) | bitpit::SkdNode | |
| CHILD_LEFT enum value (defined in bitpit::SkdNode) | bitpit::SkdNode | |
| CHILD_RIGHT enum value (defined in bitpit::SkdNode) | bitpit::SkdNode | |
| ChildLocation enum name (defined in bitpit::SkdNode) | bitpit::SkdNode | |
| evalBoxWeightedMean() const | bitpit::SkdNode | |
| evalBoxWeightedMean(int direction) const | bitpit::SkdNode | |
| evalPointDistance(const std::array< double, 3 > &point, bool interiorCellsOnly) const | bitpit::SkdNode | |
| evalPointMaxDistance(const std::array< double, 3 > &point) const | bitpit::SkdBox | |
| evalPointMaxDistance(const std::array< double, 3 > &point, double emptyDistance) const | bitpit::SkdBox | |
| evalPointMaxSquareDistance(const std::array< double, 3 > &point) const | bitpit::SkdBox | |
| evalPointMaxSquareDistance(const std::array< double, 3 > &point, double emptySquareDistance) const | bitpit::SkdBox | |
| evalPointMinDistance(const std::array< double, 3 > &point) const | bitpit::SkdBox | |
| evalPointMinDistance(const std::array< double, 3 > &point, double emptyDistance) const | bitpit::SkdBox | |
| evalPointMinSquareDistance(const std::array< double, 3 > &point) const | bitpit::SkdBox | |
| evalPointMinSquareDistance(const std::array< double, 3 > &point, double emptySquareDistance) const | bitpit::SkdBox | |
| findPointClosestCell(const std::array< double, 3 > &point, bool interiorCellsOnly, long *closestId, double *closestDistance) const | bitpit::SkdNode | |
| getBoundingBox() const | bitpit::SkdNode | |
| getBoxMax() const | bitpit::SkdBox | |
| getBoxMin() const | bitpit::SkdBox | |
| getCell(std::size_t n) const | bitpit::SkdNode | |
| getCellCount() const | bitpit::SkdNode | |
| getCells() const | bitpit::SkdNode | |
| getChildId(ChildLocation child) const | bitpit::SkdNode | |
| hasChild(ChildLocation child) const | bitpit::SkdNode | |
| isEmpty() const | bitpit::SkdBox | |
| isLeaf() const | bitpit::SkdNode | |
| m_boxMax (defined in bitpit::SkdBox) | bitpit::SkdBox | protected |
| m_boxMin (defined in bitpit::SkdBox) | bitpit::SkdBox | protected |
| MAX_CHILDREN (defined in bitpit::SkdNode) | bitpit::SkdNode | static |
| NULL_ID | bitpit::SkdNode | static |
| PatchSkdTree (defined in bitpit::SkdNode) | bitpit::SkdNode | friend |
| SkdBox() | bitpit::SkdBox | |
| SkdBox(const std::array< double, 3 > &boxMin, const std::array< double, 3 > &boxMax) | bitpit::SkdBox | |
| SkdNode() | bitpit::SkdNode | |
| SkdNode(const SkdPatchInfo *patchInfo, std::size_t cellRangeBegin, std::size_t cellRangeEnd) | bitpit::SkdNode | |
| updatePointClosestCell(const std::array< double, 3 > &point, bool interiorCellsOnly, long *closestId, double *closestDistance) const | bitpit::SkdNode | |
| updatePointClosestCells(const std::array< double, 3 > &point, bool interiorCellsOnly, std::vector< long > *closestIds, double *closestDistance) const | bitpit::SkdNode |
1.13.2