Regular pointer-style trees (as opposed to THOR trees). More...
Functions | |
| template<typename TMetricTree > | |
| TMetricTree * | MakeGenMetricTree (Matrix &matrix, index_t leaf_size, ArrayList< index_t > *old_from_new=NULL, ArrayList< index_t > *new_from_old=NULL) |
| Creates a ball tree from data. | |
Regular pointer-style trees (as opposed to THOR trees).
| TMetricTree* proximity::MakeGenMetricTree | ( | Matrix & | matrix, | |
| index_t | leaf_size, | |||
| ArrayList< index_t > * | old_from_new = NULL, |
|||
| ArrayList< index_t > * | new_from_old = NULL | |||
| ) | [inline] |
Creates a ball tree from data.
This requires you to pass in two unitialized ArrayLists which will contain index mappings so you can account for the re-ordering of the matrix. (By unitialized I mean don't call Init on it)
| matrix | data where each column is a point, WHICH WILL BE RE-ORDERED | |
| leaf_size | the maximum points in a leaf | |
| old_from_new | pointer to an unitialized arraylist; it will map new indices to original | |
| new_from_old | pointer to an unitialized arraylist; it will map original indexes to new indices |
Definition at line 76 of file gen_metric_tree.h.
1.6.3