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

[Ryan Curtin]

I am not sure this will get us much improvement except in very specific circumstances; if points are distributed on both sides of the vantage point, then the minimum bounding ball will have radius about equal to the outer radius of the hollow bound.

I think that we can do better by inspecting the parent bound... it is not hard to detect, e.g., when an outer child of an outer parent have intersecting hollow balls (in which case, MinDistance() = 0).  Bounding what that minimum distance is when the hollow balls do not intersect, though, is not math I have yet derived, but it should not be _too_ difficult.

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