HDK
|
This is the complete list of members for GEO_PointTreeGAOffset, 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_KDTree | protected |
balanceSet(int &split, fpreal &radius, int *list, int entries, fpreal *boxmin, fpreal *boxmax, UT_Lock *splitlock) | UT_KDTree | protected |
build(const GEO_Detail *gdp, const GA_PointGroup *ptgroup=NULL, bool enable_multithreading=true) | GEO_PointTreeGAOffset | |
build(const GEO_Detail *gdp, const GA_PointGroup *ptgroup, const char *attrib, bool enable_multithreading=true) | 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) override | GEO_PointTreeT< GA_Offset > | inlinevirtual |
clear() | GEO_PointTreeT< GA_Offset > | virtual |
clearPointTransform() | GEO_PointTreeT< GA_Offset > | protected |
comparePosition(int idx0, int idx1, int dim) const override | GEO_PointTreeT< GA_Offset > | protectedvirtual |
computeBox(int start_index=0) | UT_KDTree | protected |
createQueue() | UT_KDTree | protectedstatic |
dirtyKDTree() | GEO_PointTreeT< GA_Offset > | inlineprotected |
ensureTreeBuilt() | GEO_PointTreeT< GA_Offset > | inline |
entries() const | GEO_PointTreeT< GA_Offset > | |
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< 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_KDTree | inlineprotected |
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_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< 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_KDTree | inlineprotected |
GEO_PointTreeT() | GEO_PointTreeT< GA_Offset > | |
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< GA_Offset > | virtual |
getP(int idx) const override | GEO_PointTreeT< GA_Offset > | protectedvirtual |
getRadius(int idx) const override | GEO_PointTreeT< GA_Offset > | protectedvirtual |
getRebalanceCount() const | UT_KDTree | inlineprotected |
growEntries(size_t amount) | UT_KDTree | protected |
IdxArrayType typedef | GEO_PointTreeT< GA_Offset > | |
IdxType typedef | GEO_PointTreeT< GA_Offset > | |
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< GA_Offset > | protected |
myIsKDTreeDirty | GEO_PointTreeT< GA_Offset > | protected |
myList | UT_KDTree | protected |
myLock | UT_KDTree | protected |
myMaxLeafNodes | UT_KDTree | protected |
myPointList | GEO_PointTreeT< GA_Offset > | protected |
myPointTransform | GEO_PointTreeT< GA_Offset > | protected |
myRadii | GEO_PointTreeT< GA_Offset > | protected |
myRebalanceCount | UT_KDTree | protected |
mySplits | UT_KDTree | protected |
pointsHaveRadius() const override | GEO_PointTreeT< GA_Offset > | 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< GA_Offset > | inline |
setEntries(size_t size) | UT_KDTree | protected |
setMaxLeafNodes(int max_leaf_nodes) | GEO_PointTreeT< GA_Offset > | inline |
setPointTransform(const UT_DMatrix4 &xform) | GEO_PointTreeT< GA_Offset > | |
setRebalanceCount(size_t count) | UT_KDTree | protected |
Super typedef | GEO_PointTreeGAOffset | |
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< GA_Offset > | 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< GA_Offset > | |
~UT_KDTree() | UT_KDTree | protectedvirtual |