[mlpack-git] [mlpack/mlpack] Hilbert R tree (#664)
Ryan Curtin
notifications at github.com
Tue Jun 21 15:20:34 EDT 2016
> + void Copy(TreeType* dst, TreeType* src);
> +
> + void NullifyData();
> +
> + /**
> + * Update the largest Hilbert value and the local dataset.
> + * The children of the node (or the points that the node contains) should be
> + * arranged according to their Hilbert values.
> + * @param node The node in which the information should be updated.
> + */
> + template<typename TreeType>
> + void UpdateLargestValue(TreeType* node);
> +
> + template<typename TreeType>
> + void UpdateHilbertValues(TreeType* parent, size_t firstSibling,
> + size_t lastSibling);
I am not sure I understand what these functions do or how they are used... do you think you could update the documentation?
I think that `UpdateLargestValue` is used after a point is added to a node, to update the `DiscreteHilbertValue` object of all parent nodes so that the largest Hilbert value stored by any descendant is in `localDataset`. Is that correct? In that case, would it maybe be better to resize the `localDataset` of the parent node to just one element and store the largest Hilbert value there? I am not sure of the full structure, so maybe my comments are wrong, but I am having a hard time understanding.
---
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/664/files/f9127cea62d5ce1ad8d5f59931de108a2f7cdd9b#r67934409
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160621/1db8d3c5/attachment-0001.html>
More information about the mlpack-git
mailing list