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

lozhnikov notifications at github.com
Tue Jul 26 14:31:11 EDT 2016


No, I mean the minimum bounding ball of points that are contained in the node.

Thus, `HollowBallBound` is an intersection of a hollow ball and the minimum bounding ball.
I think it is correct to define `MinDistance` in such a way
```
dist1 = minBoundBall.MinDistance();
dist2 = hollowBall.MinDistance();
return max(dist1, dist2);
```
And `MaxDistance` may be the minimum of maximal distances to the ball and the hollow ball.
These estimates are rough, but I think they are close to reality.

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


More information about the mlpack-git mailing list