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.

Sign up for GitHub

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

Investigate kd trees for nearest neighbour searching #12

Open

Libbum opened this issue Feb 11, 2018 · 0 comments

Owner

Libbum commented Feb 11, 2018 •

edited

Loading

set_v and sphere_contacts could be optimised using a kd tree. May be overkill though, I'm not sure.

The text was updated successfully, but these errors were encountered:

mts42 mentioned this issue

Time complexity #13

Open

Libbum mentioned this issue

D-cell implementation for nearest neighbour searching #14

Open

6 tasks

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment