Sorry, my english is so bad ...
Dynamic in the sense of objects can move into
It is because "dynamic" may be interpreted for lot of thing in a data structure..
Here i just want a structure with moving objects (AABB), without having to rebuild a big part of the structure for each object i want to move (like for a typical static tree).
Globally, for updating an object:
- in a spatial hash, i have to rehash the new AABB and update my indexes.
- in a quad tree, i have to remove the object, and reinsert it from the root node.
But some trees are supporting an improved "update" system.
So, i'm asking which way i should investigate, tree, spatial hash or may be another.
There is a lot of theory for this kind of problem and i just want to start on the right way).
I hope this is a better explanation ...