[mlpack-git] [mlpack/mlpack] R+ and R++ trees implementation (#699)
lozhnikov
notifications at github.com
Wed Jun 29 17:14:28 EDT 2016
> + return AssignToSecondTree;
> +
> + return SplitRequired;
> + }
> +
> + /**
> + * Return the maximum bounding rectangle of the node.
> + * This method should always return the bound that is used for the
> + * desicion-making in GetSplitPolicy().
> + *
> + * @param node The node whose bound is requested.
> + */
> + template<typename TreeType>
> + static const
> + bound::HRectBound<metric::EuclideanDistance, typename TreeType::ElemType>&
> + Bound(const TreeType& node)
I am not sure since `RPlusTreeSplitPolicy::Bound()` returns the minimum bounding rectangle. This method is used in `SweepType` to determine candidates for partitioning.
---
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/699/files/e165d759f9ae612b9965f70fbbf8abdb19dc8d07#r69029365
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160629/4246ee7f/attachment.html>
More information about the mlpack-git
mailing list