You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
the paramter struct kdhyperrect* rect is no change all the time.it's obvious wrong
The text was updated successfully, but these errors were encountered: