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

Project 1: Xueyin Wan #24

Open
wants to merge 16 commits into
base: master
Choose a base branch
from
Prev Previous commit
Next Next commit
Format
  • Loading branch information
Xueyin committed Sep 14, 2016
commit 7885a223a6f1ccce676b9687203f4f73a4e7bab5
4 changes: 3 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -26,7 +26,7 @@
###Performance Analysis


I choose use 1st method : Disable visualization (#define VISUALIZE to 0 ) to measure performance.
I choose to use 1st method : Disable visualization (#define VISUALIZE to 0 ) to measure performance.
###Without Visualization
####(#define VISUALIZE 0)
| Algorithm | Number of boids | Framerate (FPS) |
@@ -50,6 +50,8 @@ Answer:
* Brute Force neighbor search algorithm: as the number of boids increases, frame-rate decreases very fast
* Uniform Grid neighbor search: the number of boids could as many as almost 80000 as the fps keeps at 60, performance is much better than Brute Force neighbor search algorithm.
* Coherent Uniform Grid neighbor search: the number of boids could as many as almost 100000 as the fps keeps at 60, performance is much better than Brute Force neighbor search algorithm and little better than Uniform Grid neighbor search.


####2.For each implementation, how does changing the block count and block size affect performance? Why do you think this is?

Answer: