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

balance(bool enable_multithreading=true)	UT_KDTree	private
balanceSet(int &split, fpreal &radius, int list, int entries, fpreal boxmin, fpreal boxmax, UT_Lock splitlock)	UT_KDTree	private
buildIfNeeded(bool enable_multithreading=true)	UT_KDTree	inlineprivatevirtual
computeBox(int start_index=0)	UT_KDTree	private
createQueue()	UT_KDTree	privatestatic
filterVolume(VolumeData &data, const UT_Vector3 &pos, const UT_Filter &filter, const AggregateVolume &aggdata, int max_nodes)	UT_KDTree	private
findAllClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared)	UT_KDTree	inlineprivate
findAllInsideTet(UT_IntArray &list, UT_Array< UT_Vector3 > &offs, ut_KDPQueue &q, const UT_Vector3 &a, const UT_Vector3 &b, const UT_Vector3 &c, const UT_Vector3 &d, float tolerance=1e-7f, bool wrapunitcube=false)	GEO_3DTree
findClosest(const QueryPoint &pt, fpreal max_distance_squared)	UT_KDTree	private
findClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)	UT_KDTree	private
findClosest(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)	UT_KDTree	private
findClosest(ut_KDPQueue &list, const QueryPoint &pt)	UT_KDTree	private
findClosestQueue(const QueryPoint &pt, ut_KDPQueue &queue, fpreal max_distance_squared)	UT_KDTree	private
findClosestQueue(UT_IntArray &list, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true)	UT_KDTree	private
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	private
findInLeaf(ut_KDPQueue &list, const QueryPoint &pt, int lo, int hi, int invalid_limit, int &invalid) const	UT_KDTree	private
findNClosest(UT_IntArray &list, const QueryPoint &pt, int max_nodes)	UT_KDTree	inlineprivate
flagDirty()	UT_KDTree	inlineprivate
GEO_3DTree(const UT_Array< UT_Vector3 > &points)	GEO_3DTree	inline
getBoxMax()	UT_KDTree	private
getBoxMin()	UT_KDTree	private
getEntries() const	UT_KDTree	inlineprivate
getHead() const	UT_KDTree	inlineprivate
getInvalidLimit(int maxn) const	UT_KDTree	inlineprivatevirtual
getMemoryUsage(bool inclusive) const	UT_KDTree	inlineprivate
getRadius(int) const	UT_KDTree	inlineprivatevirtual
getRebalanceCount() const	UT_KDTree	inlineprivate
getValue(int idx) const	GEO_3DTree	inline
growEntries(size_t amount)	UT_KDTree	private
isBalanced() const	UT_KDTree	inlineprivate
isBoxClose(const fpreal *P, fpreal qd, fpreal r) const	UT_KDTree	private
isValid(int) const	UT_KDTree	inlineprivatevirtual
isValid(int idx, const UT_KDQueryPt &) const	UT_KDTree	inlineprivatevirtual
isValid(int node, const UT_KDTubeQuery &) const	UT_KDTree	inlineprivate
isValid(int node, const UT_KDLineQuery &) const	UT_KDTree	inlineprivate
isValid(int node, const UT_KDTriQuery &) const	UT_KDTree	inlineprivate
isValid(int node, const UT_KDTetQuery &) const	UT_KDTree	inlineprivate
isValid(int node, const UT_KDQueryPtUnitWrap &) const	UT_KDTree	inlineprivate
myBalanced	UT_KDTree	private
myBalancer	UT_KDTree	private
myBMax	UT_KDTree	private
myBMin	UT_KDTree	private
myBoxComputed	UT_KDTree	private
myDim	UT_KDTree	private
myEntries	UT_KDTree	private
myFullEntries	UT_KDTree	private
myHasRadius	UT_KDTree	private
myList	UT_KDTree	private
myLock	UT_KDTree	private
myMaxLeafNodes	UT_KDTree	private
myRebalanceCount	UT_KDTree	private
mySplits	UT_KDTree	private
pointsHaveRadius() const	UT_KDTree	inlineprivatevirtual
recurseFind(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const	UT_KDTree	private
recurseFindTri(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const	UT_KDTree	private
recurseFindTube(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const	UT_KDTree	private
setBalancer(ut_KDBalancer balance)	UT_KDTree	inlineprivate
setEntries(size_t size)	UT_KDTree	private
setMaxLeafNodes(int max_leaf_nodes)	UT_KDTree	inlineprivate
setRebalanceCount(size_t count)	UT_KDTree	private
traverse(Visitor &visitor)	UT_KDTree	private
traverseRecursive(Visitor &visitor, int split, int nodeid, UT_BoundingBox &box, int lo, int hi)	UT_KDTree	private
updatePoints()	GEO_3DTree	inline
UT_KD_CENTROID enum value	UT_KDTree	private
UT_KD_MEDIAN enum value	UT_KDTree	private
UT_KD_SAH enum value	UT_KDTree	private
ut_KDBalancer enum name	UT_KDTree	private
UT_KDTree(int dim=3, size_t size=0)	UT_KDTree	inlineprivate
~UT_KDTree()	UT_KDTree	privatevirtual