Is there a good way to, for instance, place a number of trees randomly
without having them overlap?
Currently, I use an array to store the positions and compare each new
tree to all the previous ones. This is however very slow.
I could also create a multi-dimensional B-tree array that divides the
world into a grid, thereby reducing the number of items to look up. I
wonder if that would speed things.
Post a reply to this message