[mlpack-git] [mlpack/mlpack] Vantage point tree (#708)

[lozhnikov]

> +      for (size_t ref = referenceNode.Begin(); ref < refEnd; ++ref)
> +        rule.BaseCase(query, ref);
> +
> +      numBaseCases += referenceNode.Count();
> +    }
> +  }
> +  else if (((!queryNode.IsLeaf()) && referenceNode.IsLeaf()) ||
> +           (queryNode.NumDescendants() > 3 * referenceNode.NumDescendants() &&
> +            !queryNode.IsLeaf() && !referenceNode.IsLeaf()))
> +  {
> +    // We have to recurse down the query node.  In this case the recursion order
> +    // does not matter.
> +
> +    // If the first point of the query node is the centroid, the query node
> +    // contains a point. In this case we should run the single tree traverser.
> +    if (queryNode.IsFirstPointCentroid())

If the query node contains a point we have to use the single tree traverser.

---
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/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71836802
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160722/11843e0d/attachment.html>