Split a node into two parts according to the median address of points contained in the node. More...
Split a node into two parts according to the median address of points contained in the node.
The class reorders the dataset such that points with lower addresses belong to the left subtree and points with high addresses belong to the right subtree.
Definition at line 29 of file ub_tree_split.hpp.