kdtree Struct Reference

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. More...

#include <tdkdtree.h>

Collaboration diagram for kdtree:

[legend]

Data Fields
double **	y
int	n
int	k
int *	perm
kdnode *	root

---

Detailed Description

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.

Definition at line 79 of file tdkdtree.h.

---

Field Documentation

int k

Definition at line 83 of file tdkdtree.h.

int n

Definition at line 82 of file tdkdtree.h.

int* perm

Definition at line 84 of file tdkdtree.h.

kdnode* root

Definition at line 85 of file tdkdtree.h.

double** y

Definition at line 81 of file tdkdtree.h.

---

The documentation for this struct was generated from the following file:

• tdkdtree.h