The Cuik KD-Tree Library
TKDtree Struct Reference A KD-tree. More...
Collaboration diagram for TKDtree:
Detailed DescriptionThis structure is used to represent a kd-tree or any kd-sub-tree, including leaves. For simplicity reasons, we us a recursive implementation of most of the methods for the kd-tree. Note that our implementation of the kd-tree does not include the points but only pointer to them. Definition at line 52 of file cuik-kdtree.h. Field Documentation
TRUE if the sub-tree is a leaf Definition at line 53 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), PrintKDtree(), SampleInKDtree(), SearchInBallKDtree(), and SearchKDtree().
Dimension of the ponits. Definition at line 56 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), PrintKDtree(), SearchInBallKDtree(), and SearchKDtree().
Number of points in this sub-tree. Definition at line 57 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), NearestNeighbour(), NeighboursInBall(), PrintKDtree(), SearchInBallKDtree(), and SearchKDtree().
Maximum number of points in the leaves. Definition at line 58 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), and BuildKDTree().
The expansion factor to use in the sampling. Definition at line 59 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), and KDtreeSamplingExpansion().
Box defining the ambient space for all points. Definition at line 60 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), SearchInBallKDtree(), and SearchKDtree().
Topology (Real,Circle) for each dimension. Definition at line 61 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), SearchInBallKDtree(), and SearchKDtree().
Height of this sub-tree. Definition at line 62 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), and BuildKDTree().
Volume of the sampling area. Definition at line 63 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), and SampleInKDtree().
Dimension used to split the points. Definition at line 66 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), PrintKDtree(), SearchInBallKDtree(), and SearchKDtree().
Value used to split the points. Definition at line 67 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), and PrintKDtree().
Left sub-tree. Definition at line 68 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), PrintKDtree(), SampleInKDtree(), SearchInBallKDtree(), and SearchKDtree().
Rght sub-tree. Definition at line 69 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), PrintKDtree(), SampleInKDtree(), SearchInBallKDtree(), and SearchKDtree().
Left-most leaf in the sub-tree. Definition at line 70 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), and BuildKDTree().
Right-most leaf inthe sub-tree. Definition at line 71 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), and BuildKDTree().
Next leaf in the tree. Definition at line 74 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), and BuildKDTree().
Points in the leaf. Definition at line 75 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), PrintKDtree(), SearchInBallKDtree(), and SearchKDtree().
Identifiers of the points in the leaf. Definition at line 76 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), PrintKDtree(), SearchInBallKDtree(), and SearchKDtree().
Actual bouding box for the points. Definition at line 77 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), PrintKDtree(), SearchInBallKDtree(), and SearchKDtree().
Sampling box (the bounding box enlarged by 'r'). Definition at line 78 of file cuik-kdtree.h. Referenced by AddPoint2KDtree(), BuildKDTree(), DeleteKDtree(), and SampleInKDtree(). The documentation for this struct was generated from the following file: |
Follow us!