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

Optimize neighbor search algorithm #18

Open
4 tasks
aartiukh opened this issue May 1, 2019 · 0 comments
Open
4 tasks

Optimize neighbor search algorithm #18

aartiukh opened this issue May 1, 2019 · 0 comments

Comments

@aartiukh
Copy link
Owner

aartiukh commented May 1, 2019

Currently NSA is very slow. Consider to replace it with new one.

TODO:

  • Discover what algorithms are usually used to find neighbours in SPH.
  • Implement a benchmark in Python and compare at least 3 algorithms: naive, mesh-based and hash-based.
  • Publish benchmarking results in Wiki
  • Implement the fastest algorithms in C++ if it is not implemented yet.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants