kdtree - Balancing kd-tree any existing algorithm -
i'm trying implement kd-tree have problem 1 operation - balancing. existing way balance kd-tree? example: after inserting new element i'd have still balanced tree
the usual approach seems to collect new elements in list, , every , rebuild tree changes completely.
fully rebalancing k-d-tree infeasible. there tradeoff solutions.
but usually, if want balanced tree, go r*-tree instead.
Comments
Post a Comment