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

[Ryan Curtin]

> +    for (size_t d = 0; d < dim; d++)
> +    {
> +      lower = loBound(d, i) - point[d];
> +      higher = point[d] - hiBound(d, i);
> +
> +      // Since only one of 'lower' or 'higher' is negative, if we add each's
> +      // absolute value to itself and then sum those two, our result is the
> +      // nonnegative half of the equation times two; then we raise to power Power.
> +      sum += pow((lower + fabs(lower)) + (higher + fabs(higher)),
> +          (ElemType) MetricType::Power);
> +    }
> +
> +    if (sum < minSum)
> +      minSum = sum;
> +  }
> +

I see.  Do you think it would make more sense, then, to construct the minimum bounding rectangle on the points held in the node and not on the other rectangles in the node?

-- 
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/8c5a97dcb1641ae6c98edc70426fb19f5cd7cb79#r75345587
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160818/ab7b8a0c/attachment.html>