适用于Java中的Flocking Boids的2D空间数据结构

Question

I'm working on a flocking boids simulation just for fun, and I want to optimise it a bit. The area that needs work is finding boids near a given boid. I figure that to do that some kind of spatial data-structure suited to the task would be my best bet (see here and scroll down a bit.).

Whatever I go with, I'll implement myself, from scratch, in Java. That way I'll learn more about the data structure I choose than I would if I just called a bunch of library functions.

I'm aware of R-Trees , kd trees , and Quadtrees . They're all feasible options, in my opinion. But I don't have any experience with these data structures and I'm not totally sure what best suits my purpose. I don't need anything on this scale - I'm talking maybe a few hundred boids, perhaps at most one thousand, rather than a million, although bear in mind I might end up running it on an Android phone eventually.

Please recommend me a data structure (not limited to the above, of course) for this, and give me a good reason to choose it over the alternatives.

Yes, I've seen this question . No, I'm not satisfied with the answer - there's no reasoning given at all.

Oh, one other thing - like the title says, this is strictly for two dimensions only.

Answer 1

Quadtrees are a pretty standard data structure used for hit detection in video games. I think it would be well suited for your goal.

https://gamedevelopment.tutsplus.com/tutorials/quick-tip-use-quadtrees-to-detect-likely-collisions-in-2d-space--gamedev-374

Answer 2

Honestly, I would start with an unoptimized version and see how far you can take it (how many boids). After that, try different methods and measure what difference they make. I think that would be the best way to learn.