|
HDK
|
This is the complete list of members for GEO_PointTreeT< IDX_T >, including all inherited members.
| append(const UT_Vector3 &pt, IdxType idx, bool auto_rebalance=false) | GEO_PointTreeT< IDX_T > | |
| append(const UT_Vector3 &pt) | GEO_PointTreeT< IDX_T > | |
| appendPtRadius(const UT_Vector3 &pt, fpreal radius, IdxType idx, bool auto_rebalance=false) | GEO_PointTreeT< IDX_T > | |
| appendPtRadius(const UT_Vector3 &pt, fpreal radius) | GEO_PointTreeT< IDX_T > | |
| balance(bool enable_multithreading=true) | UT_KDTree | protected |
| balanceSet(int &split, fpreal &radius, int *list, int entries, fpreal *boxmin, fpreal *boxmax, UT_Lock *splitlock) | UT_KDTree | protected |
| build(const UT_Vector3Array &pts, bool enable_multithreading=true) | GEO_PointTreeT< IDX_T > | |
| build(const UT_Vector3Array &pts, const IdxArrayType &idx, bool enable_multithreading=true) | GEO_PointTreeT< IDX_T > | |
| buildIfNeeded(bool enable_multithreading=true) override | GEO_PointTreeT< IDX_T > | inlinevirtual |
| clear() | GEO_PointTreeT< IDX_T > | virtual |
| clearPointTransform() | GEO_PointTreeT< IDX_T > | protected |
| comparePosition(int idx0, int idx1, int dim) const override | GEO_PointTreeT< IDX_T > | protectedvirtual |
| computeBox(int start_index=0) | UT_KDTree | protected |
| createQueue() | UT_KDTree | protectedstatic |
| dirtyKDTree() | GEO_PointTreeT< IDX_T > | inlineprotected |
| ensureTreeBuilt() | GEO_PointTreeT< IDX_T > | inline |
| entries() const | GEO_PointTreeT< IDX_T > | |
| filterVolume(VolumeData &data, const UT_Vector3 &pos, const UT_Filter &filter, const AggregateVolume &aggdata, int max_nodes) | UT_KDTree | protected |
| findAllCloseIdx(const UT_Vector3 &pt, fpreal maxdist, IdxArrayType &list) | GEO_PointTreeT< IDX_T > | |
| findAllCloseIdxQueue(const UT_Vector3 &pt, ut_KDPQueue &queue, fpreal maxdist, IdxArrayType &list) | GEO_PointTreeT< IDX_T > | |
| findAllClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared) | UT_KDTree | inlineprotected |
| findAllInTubeIdx(const UT_Vector3 &pt, const UT_Vector3 &dir, fpreal radius, IdxArrayType &list) | GEO_PointTreeT< IDX_T > | |
| findClosest(const QueryPoint &pt, fpreal max_distance_squared) | UT_KDTree | protected |
| findClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true) | UT_KDTree | protected |
| findClosest(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true) | UT_KDTree | protected |
| findClosest(ut_KDPQueue &list, const QueryPoint &pt) | UT_KDTree | protected |
| findClosestQueue(const QueryPoint &pt, ut_KDPQueue &queue, fpreal max_distance_squared) | UT_KDTree | protected |
| findClosestQueue(UT_IntArray &list, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true) | UT_KDTree | protected |
| findClosestQueue(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true) | UT_KDTree | protected |
| findInLeaf(ut_KDPQueue &list, const QueryPoint &pt, int lo, int hi, int invalid_limit, int &invalid) const | UT_KDTree | protected |
| findNClosest(UT_IntArray &list, const QueryPoint &pt, int max_nodes) | UT_KDTree | inlineprotected |
| findNearestGroupIdx(const UT_Vector3 &pt, fpreal maxdist, int groupsize, IdxArrayType &group, UT_FloatArray &groupdist) | GEO_PointTreeT< IDX_T > | |
| findNearestGroupIdxQueue(const UT_Vector3 &pt, fpreal maxdist, int groupsize, IdxArrayType &group, UT_FloatArray &groupdist, ut_KDPQueue &q, bool wrapunitcube=false) | GEO_PointTreeT< IDX_T > | |
| findNearestIdx(const UT_Vector3 &pt) | GEO_PointTreeT< IDX_T > | |
| findNearestIdx(const UT_Vector3 &pt, fpreal maxdist) | GEO_PointTreeT< IDX_T > | |
| findNearestIdxQueue(const UT_Vector3 &pt, ut_KDPQueue &q, fpreal maxdist=1e18f, bool wrapunitcube=false) | GEO_PointTreeT< IDX_T > | |
| flagDirty() | UT_KDTree | inlineprotected |
| GEO_PointTreeT() | GEO_PointTreeT< IDX_T > | |
| getBoxMax() | UT_KDTree | protected |
| getBoxMin() | UT_KDTree | protected |
| getEntries() const | UT_KDTree | inlineprotected |
| getHead() const | UT_KDTree | inlineprotected |
| getInvalidLimit(int maxn) const | UT_KDTree | inlineprotectedvirtual |
| getMemoryUsage(bool inclusive=true) const | GEO_PointTreeT< IDX_T > | virtual |
| getP(int idx) const override | GEO_PointTreeT< IDX_T > | protectedvirtual |
| getRadius(int idx) const override | GEO_PointTreeT< IDX_T > | protectedvirtual |
| getRebalanceCount() const | UT_KDTree | inlineprotected |
| growEntries(size_t amount) | UT_KDTree | protected |
| IdxArrayType typedef | GEO_PointTreeT< IDX_T > | |
| IdxType typedef | GEO_PointTreeT< IDX_T > | |
| isBalanced() const | UT_KDTree | inlineprotected |
| isBoxClose(const fpreal *P, fpreal qd, fpreal r) const | UT_KDTree | protected |
| isValid(int) const | UT_KDTree | inlineprotectedvirtual |
| isValid(int idx, const UT_KDQueryPt &) const | UT_KDTree | inlineprotectedvirtual |
| isValid(int node, const UT_KDTubeQuery &) const | UT_KDTree | inlineprotected |
| isValid(int node, const UT_KDLineQuery &) const | UT_KDTree | inlineprotected |
| isValid(int node, const UT_KDTriQuery &) const | UT_KDTree | inlineprotected |
| isValid(int node, const UT_KDTetQuery &) const | UT_KDTree | inlineprotected |
| isValid(int node, const UT_KDQueryPtUnitWrap &) const | UT_KDTree | inlineprotected |
| myBalanced | UT_KDTree | protected |
| myBalancer | UT_KDTree | protected |
| myBMax | UT_KDTree | protected |
| myBMin | UT_KDTree | protected |
| myBoxComputed | UT_KDTree | protected |
| myDim | UT_KDTree | protected |
| myEntries | UT_KDTree | protected |
| myFullEntries | UT_KDTree | protected |
| myHasRadius | UT_KDTree | protected |
| myIndexList | GEO_PointTreeT< IDX_T > | protected |
| myIsKDTreeDirty | GEO_PointTreeT< IDX_T > | protected |
| myList | UT_KDTree | protected |
| myLock | UT_KDTree | protected |
| myMaxLeafNodes | UT_KDTree | protected |
| myPointList | GEO_PointTreeT< IDX_T > | protected |
| myPointTransform | GEO_PointTreeT< IDX_T > | protected |
| myRadii | GEO_PointTreeT< IDX_T > | protected |
| myRebalanceCount | UT_KDTree | protected |
| mySplits | UT_KDTree | protected |
| pointsHaveRadius() const override | GEO_PointTreeT< IDX_T > | protectedvirtual |
| recurseFind(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const | UT_KDTree | protected |
| recurseFindTri(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const | UT_KDTree | protected |
| recurseFindTube(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const | UT_KDTree | protected |
| setBalancer(ut_KDBalancer balance) | GEO_PointTreeT< IDX_T > | inline |
| setEntries(size_t size) | UT_KDTree | protected |
| setMaxLeafNodes(int max_leaf_nodes) | GEO_PointTreeT< IDX_T > | inline |
| setPointTransform(const UT_DMatrix4 &xform) | GEO_PointTreeT< IDX_T > | |
| setRebalanceCount(size_t count) | UT_KDTree | protected |
| traverse(Visitor &visitor) | UT_KDTree | protected |
| traverseRecursive(Visitor &visitor, int split, int nodeid, UT_BoundingBox &box, int lo, int hi) | UT_KDTree | protected |
| updateKDTree(bool enablemultithread=true) | GEO_PointTreeT< IDX_T > | protected |
| UT_KD_CENTROID enum value | UT_KDTree | protected |
| UT_KD_MEDIAN enum value | UT_KDTree | protected |
| UT_KD_SAH enum value | UT_KDTree | protected |
| ut_KDBalancer enum name | UT_KDTree | protected |
| UT_KDTree(int dim=3, size_t size=0) | UT_KDTree | inlineprotected |
| ~GEO_PointTreeT() override | GEO_PointTreeT< IDX_T > | |
| ~UT_KDTree() | UT_KDTree | protectedvirtual |
1.8.6 
