Testing each algorithm is the only way to be certain which one is quickest for your use.
However A 2D grid is usually fast enough if the size of the grid cells is chosen well. In 3D however grids can be very wasteful of memory.
Finding neighbouring agents within interaction range efficiently
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement