I caught wind of Love on Hacker news, and I decided to try it out. Noticing that you guys were missing a flocking boid simulation in your demos, I decided to write one. The love file is attached at the bottom, and the details of it are in a blog post I wrote.
some people are really talented here...
Very interesting! I love flocks of birds. I've seen recently a similar one like on the video on your website...
iamwilhelm wrote:Oh, I forgot to mention that clicking on the screen puts more plants in the world.
The current algorithm for calculating k-nearest neighbors is naive, so it's O(n^2). That'll be remedied as soon as I figure out how to do it.
You can actually find all n nearest neighbors in O(n log n) time, but it's a bit complicated. See An optimal algorithm for the All-Nearest-Neighbors problem by Pravin Vaidya (1986): http://ieeexplore.ieee.org.ludwig.lub.l ... 568202.pdf. O(n log n) k-nearest neighbor is mentioned in the same paper. If you were to implement this, or an approximation or heuristic algorithm, please do share with the rest of us .
iamwilhelm wrote:Oh, I forgot to mention that clicking on the screen puts more plants in the world.
The current algorithm for calculating k-nearest neighbors is naive, so it's O(n^2). That'll be remedied as soon as I figure out how to do it.
You can actually find all n nearest neighbors in O(n log n) time, but it's a bit complicated. See An optimal algorithm for the All-Nearest-Neighbors problem by Pravin Vaidya (1986): http://ieeexplore.ieee.org.ludwig.lub.l ... 568202.pdf. O(n log n) k-nearest neighbor is mentioned in the same paper. If you were to implement this, or an approximation or heuristic algorithm, please do share with the rest of us .
Yeah, I'll let you guys know what I end up coming up with. Been getting some pointers to papers here, and there. Just have to make use to my peeps in universities to get these papers for free...
frock.love
.
