[mlpack-git] [mlpack/mlpack] General greedy traverser. (#762)

[MarcosPividori]

@rcurtin , Yeah, I think we have to wait until the refactoring of `SplitSpace`.
If we modify the `BinarySpaceTree` to hold a `Hyperplane` instance, we will be able to efficiently estimate the nearest and furthest child as I do with SpillTrees in: https://github.com/MarcosPividori/mlpack/blob/greedy-traverser/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp#L333
I think this is ready to be merged. 

-- 
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/762#issuecomment-241094087
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160819/1a1c91a6/attachment.html>