We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
是否可以考虑在四叉树中实现并行? 从方法适用性上看,四叉树能处理粒子法中变光滑长度的问题,它的时间复杂度O(Nlog_10(N))处于直接搜索法O(N^2)和链表法O(N)之间。 且四叉树在其它领域也多有应用,相信找到相应的并行解决方案不是很难。
它是一种成熟且理想的粒子搜索方式,支持并行肯定非常值得!
The text was updated successfully, but these errors were encountered:
No branches or pull requests
是否可以考虑在四叉树中实现并行?
从方法适用性上看,四叉树能处理粒子法中变光滑长度的问题,它的时间复杂度O(Nlog_10(N))处于直接搜索法O(N^2)和链表法O(N)之间。
且四叉树在其它领域也多有应用,相信找到相应的并行解决方案不是很难。
它是一种成熟且理想的粒子搜索方式,支持并行肯定非常值得!
参考资料
The text was updated successfully, but these errors were encountered: