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

[Ryan Curtin]

Do you mean the minimum bounding ball of the parent bound?  If so, I think that is perfectly reasonable.  All we need to do is provide a `MinDistance()` and `MaxDistance()` function that calculate tight lower and upper bounds on the distance between a query point and all a node's descendant points, or one node's descendant points and another node's descendant points.  So any clever optimizations we can do inside of the vantage point tree are fair game.  (As long as we document it, so that when someone goes to modify it later they can understand what is going on! :))

---
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#issuecomment-235358294
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160726/3ffea5ca/attachment.html>