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

[Ryan Curtin]

> +        if (rightScore != DBL_MAX)
> +        {
> +          // Restore the right traversal info.
> +          rule.TraversalInfo() = traversalInfo;
> +          Traverse(queryNode, *referenceNode.Right());
> +        }
> +        else
> +          ++numPrunes;
> +      }
> +    }
> +  }
> +  else
> +  {
> +    // If the reference node contains a point we should calculate all
> +    // base cases with this point.
> +    if (referenceNode.IsFirstPointCentroid())

Ah hang on, but we could end up with duplicated base cases like this.  Let me think for a while if there might be a better way to avoid duplications but preserve this type of technique.  Maybe you are right that traversing with a query node and a reference point could work, but that would require a lot of refactoring of all the dual-tree algorithms so I'd prefer to avoid that...

---
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#r71899891
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160722/9246c85c/attachment-0001.html>