| infokdnode | Information for a Node definition. This data structure saves the information related for a virtual internal node. The variables have the meaning given for the kdnode data structure. The points that are virtually contained in the loson and hison are represented by indexes that are in the range perm[lopt_l,hipt_l] and perm[lopt_h,hipt_h], respectively |
| kdnode | Node definition. There exists two types of nodes: internal nodes partition the space by a cut plane defined by a value in one of the k dimensions; external nodes (aka buckets) store the points in the resulting hyperplanes of the partition. The variable bucket is 1 if the node is a bucket and zero if it is an internal node. In an internal node, cutdim gives the dimension being partitioned, cutval is a value in that dimension, and loson and hison are pointers to its two subtrees (containing respectively, points not greather than and not less than cutval in that dimension). In a bucket, the points that are contained in it are represented by indexes that are in the range perm[lopt,hipt]. The global variable perm is called as permutation vector. The number of points is represented by the expression hipt - lopt + 1 |
| kdtree | Multidimensional tree definition. A k-dimensional binary search tree (abbreviated kd-tree) represents a set of n points {y} in an space of k dimensions. The variable perm is the permutation vector that contains the indices of all the points. The variable root is the tree root |
| qnode | Node definition. The variable info is a pointer to the information contained in the node and next is a pointer to the next element in the queue |
| queue | Queue definition. A queue is a standard queue that has infokdnode data structures as elements. The variable first is a pointer to the first element and last is a pointer to the last element in the queue |
1.6.3