HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
GU_SortKDTree Member List

This is the complete list of members for GU_SortKDTree, including all inherited members.

balance(bool enable_multithreading=true)UT_KDTreeprotected
balanceSet(int &split, fpreal &radius, int *list, int entries, fpreal *boxmin, fpreal *boxmax, UT_Lock *splitlock)UT_KDTreeprotected
buildIfNeeded(bool enable_multithreading=true)UT_KDTreeinlinevirtual
comparePosition(int idx0, int idx1, int dim) const overrideGU_SortKDTreeinlinevirtual
computeBox(int start_index=0)UT_KDTreeprotected
createQueue()UT_KDTreestatic
filterVolume(VolumeData &data, const UT_Vector3 &pos, const UT_Filter &filter, const AggregateVolume &aggdata, int max_nodes)UT_KDTree
findAllClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared)UT_KDTreeinline
findClosest(const QueryPoint &pt, fpreal max_distance_squared)UT_KDTree
findClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)UT_KDTree
findClosest(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)UT_KDTree
findClosest(ut_KDPQueue &list, const QueryPoint &pt)UT_KDTreeprotected
findClosestQueue(const QueryPoint &pt, ut_KDPQueue &queue, fpreal max_distance_squared)UT_KDTree
findClosestQueue(UT_IntArray &list, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true)UT_KDTree
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
findInLeaf(ut_KDPQueue &list, const QueryPoint &pt, int lo, int hi, int invalid_limit, int &invalid) const UT_KDTreeprotected
findNClosest(UT_IntArray &list, const QueryPoint &pt, int max_nodes)UT_KDTreeinline
flagDirty()UT_KDTreeinline
getBoxMax()UT_KDTree
getBoxMin()UT_KDTree
getEntries() const UT_KDTreeinline
getHead() const UT_KDTreeinlineprotected
getIndices() const GU_SortKDTreeinline
getInvalidLimit(int maxn) const UT_KDTreeinlinevirtual
getMemoryUsage(bool inclusive) const UT_KDTreeinline
getP(int idx) const overrideGU_SortKDTreeinlinevirtual
getRadius(int) const UT_KDTreeinlinevirtual
getRebalanceCount() const UT_KDTreeinline
growEntries(size_t amount)UT_KDTree
GU_SortKDTree(size_t size)GU_SortKDTreeinline
isBalanced() const UT_KDTreeinlineprotected
isBoxClose(const fpreal *P, fpreal qd, fpreal r) const UT_KDTreeprotected
isValid(int) const UT_KDTreeinlinevirtual
isValid(int idx, const UT_KDQueryPt &) const UT_KDTreeinlinevirtual
isValid(int node, const UT_KDTubeQuery &) const UT_KDTreeinlineprotected
isValid(int node, const UT_KDLineQuery &) const UT_KDTreeinlineprotected
isValid(int node, const UT_KDTriQuery &) const UT_KDTreeinlineprotected
isValid(int node, const UT_KDTetQuery &) const UT_KDTreeinlineprotected
isValid(int node, const UT_KDQueryPtUnitWrap &) const UT_KDTreeinlineprotected
myBalancedUT_KDTreeprotected
myBalancerUT_KDTreeprotected
myBMaxUT_KDTreeprotected
myBMinUT_KDTreeprotected
myBoxComputedUT_KDTreeprotected
myDimUT_KDTreeprotected
myEntriesUT_KDTreeprotected
myFullEntriesUT_KDTreeprotected
myHasRadiusUT_KDTreeprotected
myListUT_KDTreeprotected
myLockUT_KDTreeprotected
myMaxLeafNodesUT_KDTreeprotected
myRebalanceCountUT_KDTreeprotected
mySplitsUT_KDTreeprotected
pointsHaveRadius() const UT_KDTreeinlinevirtual
recurseFind(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const UT_KDTreeprotected
recurseFindTri(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const UT_KDTreeprotected
recurseFindTube(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const UT_KDTreeprotected
setBalancer(ut_KDBalancer balance)UT_KDTreeinline
setEntries(size_t size)UT_KDTree
setMaxLeafNodes(int max_leaf_nodes)UT_KDTreeinline
setPos(int idx, const UT_Vector3 &pos)GU_SortKDTreeinline
setRebalanceCount(size_t count)UT_KDTree
traverse(Visitor &visitor)UT_KDTree
traverseRecursive(Visitor &visitor, int split, int nodeid, UT_BoundingBox &box, int lo, int hi)UT_KDTreeprotected
UT_KD_CENTROID enum valueUT_KDTree
UT_KD_MEDIAN enum valueUT_KDTree
UT_KD_SAH enum valueUT_KDTree
ut_KDBalancer enum nameUT_KDTree
UT_KDTree(int dim=3, size_t size=0)UT_KDTreeinline
~UT_KDTree()UT_KDTreevirtual