Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

It's the number of neighbors each boid considers to calculate its velocity. There's also an option that defines the maximum distance for collision detection, but it's not accessible through the UI.


Thanks! The canonical data structure to avoid the O(n^2) lookup is a kdtree, which I think is reasonably easy to implement in coffeescript.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: