I'm trying to code a spatial acceleration data structure to deal with a large number of rigid bodies or particles & as this is continually going to be updating/expanding (using 'spatial hashing' i.e http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.5881&rep=rep1&type=pdf) I was wondering if there are any containers in TBB which would be suitable?
Also, how could I get the best performance & minimum memory hit when using such a dynamic data structure?
At a glance, TBB hash maps (concurrent_hash_map or concurrent_unordered_map) seem to be suitable. You would have to check the details, including whether performance & memory footprint meet the requirements.
