[mlpack-git] [mlpack/mlpack] Universal B tree implementation (#746)

[lozhnikov]

The UB tree has two problems.

The bound of the tree is not the tightest since the tightest bound requires a lot of computations in `MinDistance()`. That can explain that the number of base cases with the kd tree is less than the number of base cases with the UB tree.

And the second problem is the performance of `MinDistance()`. The function calculates the distance to a number of hyperrectangles. I believe that many of them may be pruned but I do not know exactly how.

-- 
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/746#issuecomment-240361014
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160817/dfe7e31c/attachment.html>