Show HN: Boids Simulation
anoopelias.github.io
Show HN: Boids Simulation
1–10 of 31 posts
Re: Show HN: Boids Simulation
#2[deleted]
Re: Show HN: Boids Simulation
#3Nice! I've done something similar in the past:
http://static.mysti.co.in/boids/
Re: Show HN: Boids Simulation
#4If you're into this kind of artificial life simulation, I can recommend you watching this talk: http://developertalks.tumblr.com/post/109998034809/simon-swa...
Re: Show HN: Boids Simulation
#5If you're into this kind of artificial life simulation, I can recommend you watching this talk: http://developertalks.tumblr.com/post/109998034809/simon-swa...
Excellent link. Thank you.
I haven't looked deep in to these kind of simulations in general. Inspiration came from the Princeton Algortihms course in coursera.org. There is this sample problem, http://www.cs.princeton.edu/courses/archive/spr10/cos226/ass...
Re: Show HN: Boids Simulation
#6For ones want to dive deeper into collective motion and self-propelled particles: http://arxiv.org/abs/1010.5017
Re: Show HN: Boids Simulation
#7Somewhat related:
ThreeJS GPU boids simulation http://threejs.org/examples/#webgl_gpgpu_birds
Re: Show HN: Boids Simulation
#8I was inspired by this to create my own a few months ago. It uses a quadtree to optimize nearest neighbor lookup to ideally reduce complexity from n^2 to nlogn on each tick.
http://jrhdoty.github.io/SwarmJS/
Re: Show HN: Boids Simulation
#9If you enjoy this kind of simulations, this is a good intro book. http://natureofcode.com/
Re: Show HN: Boids Simulation
#10I was inspired by this to create my own a few months ago. It uses a quadtree to optimize nearest neighbor lookup to ideally reduce complexity from n^2 to nlogn on each tick. http://jrhdoty.github.io/SwarmJS/
Yes, looks beautiful. Quite similar, I guess.
I had run in to some performance issues, the initial few ticks are quiet slow even now, esp. on a phone.
This one uses a kdtree instead. I'll have to try quadtree and benchmark. Thanks.