<p>In <a href="https://github.com/mlpack/mlpack/pull/746#discussion_r75268763">src/mlpack/core/tree/cellbound_impl.hpp</a>:</p>
<pre style='color:#555'>> + 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;
> + }
> +
</pre>
<p>This is useless since I bound each rectangle in the series by the minimum bounded rectangle (see <code>AddBound()</code>).</p>
<pre><code>loBound(k, numBounds) = std::max(loCorner[k], bounds[k].Lo());
hiBound(k, numBounds) = std::min(bounds[k].Hi(), hiCorner[k]);
</code></pre>
<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">—<br />You are receiving this because you are subscribed to this thread.<br />Reply to this email directly, <a href="https://github.com/mlpack/mlpack/pull/746/files/8c5a97dcb1641ae6c98edc70426fb19f5cd7cb79#r75268763">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe-auth/AJ4bFBpTbnw5iUWz4PwI1eFvv5KP3xLdks5qhBpsgaJpZM4JZrEi">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFNgvAOBIXRUbqfaywiMq9bLhjzBrks5qhBpsgaJpZM4JZrEi.gif" width="1" /></p>
<div itemscope itemtype="http://schema.org/EmailMessage">
<div itemprop="action" itemscope itemtype="http://schema.org/ViewAction">
<link itemprop="url" href="https://github.com/mlpack/mlpack/pull/746/files/8c5a97dcb1641ae6c98edc70426fb19f5cd7cb79#r75268763"></link>
<meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>
<script type="application/json" data-scope="inboxmarkup">{"api_version":"1.0","publisher":{"api_key":"05dde50f1d1a384dd78767c55493e4bb","name":"GitHub"},"entity":{"external_key":"github/mlpack/mlpack","title":"mlpack/mlpack","subtitle":"GitHub repository","main_image_url":"https://cloud.githubusercontent.com/assets/143418/17495839/a5054eac-5d88-11e6-95fc-7290892c7bb5.png","avatar_image_url":"https://cloud.githubusercontent.com/assets/143418/15842166/7c72db34-2c0b-11e6-9aed-b52498112777.png","action":{"name":"Open in GitHub","url":"https://github.com/mlpack/mlpack"}},"updates":{"snippets":[{"icon":"PERSON","message":"@lozhnikov in #746: This is useless since I bound each rectangle in the series by the minimum bounded rectangle (see `AddBound()`).\r\n```\r\nloBound(k, numBounds) = std::max(loCorner[k], bounds[k].Lo());\r\nhiBound(k, numBounds) = std::min(bounds[k].Hi(), hiCorner[k]);\r\n```"}],"action":{"name":"View Pull Request","url":"https://github.com/mlpack/mlpack/pull/746/files/8c5a97dcb1641ae6c98edc70426fb19f5cd7cb79#r75268763"}}}</script>