Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

kd_nearest_i function #21

Open
bobobe opened this issue Jan 23, 2018 · 2 comments
Open

kd_nearest_i function #21

bobobe opened this issue Jan 23, 2018 · 2 comments

Comments

@bobobe
Copy link

bobobe commented Jan 23, 2018

the paramter struct kdhyperrect* rect is no change all the time.it's obvious wrong

@SuDaxia-kai
Copy link

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.

@bobobe
Copy link
Author

bobobe commented Jul 21, 2023 via email

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants