TBTree Struct Reference

Detailed Description

The tree is defined recursively using nodes as basic blocks. Those nodes can be either a leave or an internal.

The recursive definition allows for an easy recursive implementation.

Note that tree includes only the central points and the identifiers of the charts and not the full charts themselves.

Definition at line 50 of file btree.h.

Data Fields
unsigned int	m
double	r
unsigned int *	tp

Field Documentation

m

unsigned int TBTree::m

Dimension of the space where the tree is defined.

Definition at line 51 of file btree.h.

Referenced by AddChart2Btree(), InitBTree(), and SearchInBtree().

r

double TBTree::r

Radius used for the search for neighbours.

Definition at line 52 of file btree.h.

Referenced by InitBTree(), and SearchInBtree().

tp

unsigned int* TBTree::tp

The topology for each variable

Definition at line 53 of file btree.h.

Referenced by AddChart2Btree(), DeleteBTree(), InitBTree(), and SearchInBtree().