Open bobobe opened 6 years ago
I think the code is wrong. Because when we are finding the nearest node, we need to compare our node with the hyperrect of the Subtree. But the hyperrect in the code is the max rectangle containing all points.
Thanks,I'll reply you soon
the paramter struct kdhyperrect* rect is no change all the time.it's obvious wrong