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

[lozhnikov]

>  
> -    hiBound(k, numBounds) = std::min(bounds[k].Hi(), hiCorner[k]);
> +  for (size_t i = 0; i < data.n_cols; i++)

Indeed, that provides some benefits. If I am not mistaken, the minimum bounding rectangle is used in the `Contains()` function but I can replace that by the hyperrectangles.

-- 
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/files/3aee6e807d45813411ac74b3294c2a20d40ab857..f17843fc8e8ef2b1c4b04d572c521575f20a1f3c#r75855301
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160823/2522de99/attachment-0001.html>