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

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

append(const UT_Vector3 &pt, IdxType idx, bool auto_rebalance=false)GEO_PointTreeT< GA_Offset >
append(const UT_Vector3 &pt)GEO_PointTreeT< GA_Offset >
appendPtRadius(const UT_Vector3 &pt, fpreal radius, IdxType idx, bool auto_rebalance=false)GEO_PointTreeT< GA_Offset >
appendPtRadius(const UT_Vector3 &pt, fpreal radius)GEO_PointTreeT< GA_Offset >
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
build(const GEO_Detail *gdp, const GA_PrimitiveGroup *primgroup, const char *attrib, bool enable_multithreading=true)sop_CurveTree
build(const GEO_Detail *gdp, const GA_PointGroup *ptgroup, bool enable_multithreading=true)sop_CurveTreeinline
build(const GEO_Detail *gdp, const GA_PointGroup *ptgroup, const char *attrib, bool enable_multithreading=true)sop_CurveTreeinline
GEO_PointTreeGAOffset::build(const GEO_Detail *gdp, const GA_OffsetArray &ptoffsets, bool enable_multithreading=true)GEO_PointTreeGAOffset
GEO_PointTreeT< GA_Offset >::build(const UT_Vector3Array &pts, bool enable_multithreading=true)GEO_PointTreeT< GA_Offset >
GEO_PointTreeT< GA_Offset >::build(const UT_Vector3Array &pts, const IdxArrayType &idx, bool enable_multithreading=true)GEO_PointTreeT< GA_Offset >
buildIfNeeded(bool enable_multithreading=true) overrideGEO_PointTreeT< GA_Offset >inlinevirtual
clear()GEO_PointTreeT< GA_Offset >virtual
clearPointTransform()GEO_PointTreeT< GA_Offset >protected
comparePosition(int idx0, int idx1, int dim) const overrideGEO_PointTreeT< GA_Offset >protectedvirtual
computeBox(int start_index=0)UT_KDTreeprotected
createQueue()UT_KDTreeprotectedstatic
dirtyKDTree()GEO_PointTreeT< GA_Offset >inlineprotected
ensureTreeBuilt()GEO_PointTreeT< GA_Offset >inline
entries() constGEO_PointTreeT< GA_Offset >
filterVolume(VolumeData &data, const UT_Vector3 &pos, const UT_Filter &filter, const AggregateVolume &aggdata, int max_nodes)UT_KDTreeprotected
findAllCloseIdx(const UT_Vector3 &pt, fpreal maxdist, IdxArrayType &list)GEO_PointTreeT< GA_Offset >
findAllCloseIdxQueue(const UT_Vector3 &pt, ut_KDPQueue &queue, fpreal maxdist, IdxArrayType &list)GEO_PointTreeT< GA_Offset >
findAllClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared)UT_KDTreeinlineprotected
findAllInTubeIdx(const UT_Vector3 &pt, const UT_Vector3 &dir, fpreal radius, IdxArrayType &list)GEO_PointTreeT< GA_Offset >
findClosest(const QueryPoint &pt, fpreal max_distance_squared)UT_KDTreeprotected
findClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)UT_KDTreeprotected
findClosest(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)UT_KDTreeprotected
findClosest(ut_KDPQueue &list, const QueryPoint &pt)UT_KDTreeprotected
findClosestQueue(const QueryPoint &pt, ut_KDPQueue &queue, fpreal max_distance_squared)UT_KDTreeprotected
findClosestQueue(UT_IntArray &list, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true)UT_KDTreeprotected
findClosestQueue(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true)UT_KDTreeprotected
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_KDTreeinlineprotected
findNearestGroupIdx(const UT_Vector3 &pt, fpreal maxdist, int groupsize, IdxArrayType &group, UT_FloatArray &groupdist)GEO_PointTreeT< GA_Offset >
findNearestGroupIdxQueue(const UT_Vector3 &pt, fpreal maxdist, int groupsize, IdxArrayType &group, UT_FloatArray &groupdist, ut_KDPQueue &q, bool wrapunitcube=false)GEO_PointTreeT< GA_Offset >
findNearestIdx(const UT_Vector3 &pt)GEO_PointTreeT< GA_Offset >
findNearestIdx(const UT_Vector3 &pt, fpreal maxdist)GEO_PointTreeT< GA_Offset >
findNearestIdxQueue(const UT_Vector3 &pt, ut_KDPQueue &q, fpreal maxdist=1e18f, bool wrapunitcube=false)GEO_PointTreeT< GA_Offset >
flagDirty()UT_KDTreeinlineprotected
GEO_PointTreeT()GEO_PointTreeT< GA_Offset >
getBoxMax()UT_KDTreeprotected
getBoxMin()UT_KDTreeprotected
getEntries() const UT_KDTreeinlineprotected
getHead() const UT_KDTreeinlineprotected
getInvalidLimit(int maxn) const UT_KDTreeinlineprotectedvirtual
getMemoryUsage(bool inclusive=true) constGEO_PointTreeT< GA_Offset >virtual
getP(int idx) const overrideGEO_PointTreeT< GA_Offset >protectedvirtual
getRadius(int idx) const overrideGEO_PointTreeT< GA_Offset >protectedvirtual
getRebalanceCount() const UT_KDTreeinlineprotected
growEntries(size_t amount)UT_KDTreeprotected
IdxArrayType typedefGEO_PointTreeT< GA_Offset >
IdxType typedefGEO_PointTreeT< GA_Offset >
isBalanced() const UT_KDTreeinlineprotected
isBoxClose(const fpreal *P, fpreal qd, fpreal r) const UT_KDTreeprotected
isValid(int) const UT_KDTreeinlineprotectedvirtual
isValid(int idx, const UT_KDQueryPt &) const UT_KDTreeinlineprotectedvirtual
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
myIndexListGEO_PointTreeT< GA_Offset >protected
myIsKDTreeDirtyGEO_PointTreeT< GA_Offset >protected
myListUT_KDTreeprotected
myLockUT_KDTreeprotected
myMaxLeafNodesUT_KDTreeprotected
myPointListGEO_PointTreeT< GA_Offset >protected
myPointTransformGEO_PointTreeT< GA_Offset >protected
myRadiiGEO_PointTreeT< GA_Offset >protected
myRebalanceCountUT_KDTreeprotected
mySplitsUT_KDTreeprotected
pointsHaveRadius() const overrideGEO_PointTreeT< GA_Offset >protectedvirtual
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)GEO_PointTreeT< GA_Offset >inline
setEntries(size_t size)UT_KDTreeprotected
setMaxLeafNodes(int max_leaf_nodes)GEO_PointTreeT< GA_Offset >inline
setPointTransform(const UT_DMatrix4 &xform)GEO_PointTreeT< GA_Offset >
setRebalanceCount(size_t count)UT_KDTreeprotected
Super typedefGEO_PointTreeGAOffset
traverse(Visitor &visitor)UT_KDTreeprotected
traverseRecursive(Visitor &visitor, int split, int nodeid, UT_BoundingBox &box, int lo, int hi)UT_KDTreeprotected
updateKDTree(bool enablemultithread=true)GEO_PointTreeT< GA_Offset >protected
UT_KD_CENTROID enum valueUT_KDTreeprotected
UT_KD_MEDIAN enum valueUT_KDTreeprotected
UT_KD_SAH enum valueUT_KDTreeprotected
ut_KDBalancer enum nameUT_KDTreeprotected
UT_KDTree(int dim=3, size_t size=0)UT_KDTreeinlineprotected
~GEO_PointTreeT() overrideGEO_PointTreeT< GA_Offset >
~UT_KDTree()UT_KDTreeprotectedvirtual