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
Currently the bottleneck is that each boid checks every other boid to see how far away they are.
This means the program is O(n^2) which means we can't support more than around 100 boids.
We could do something like this to cut down on the number of boids that each boid needs to check per frame: https://mofanim.wordpress.com/2010/10/27/optimized-boids-i/
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Currently the bottleneck is that each boid checks every other boid to see how far away they are.
This means the program is O(n^2) which means we can't support more than around 100 boids.
We could do something like this to cut down on the number of boids that each boid needs to check per frame: https://mofanim.wordpress.com/2010/10/27/optimized-boids-i/
The text was updated successfully, but these errors were encountered: