TBB Container Suitable For Dynamic 3D Grid?

TBB Container Suitable For Dynamic 3D Grid?

Hey all

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= 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?


2 posts / 0 new
Last post
For more complete information about compiler optimizations, see our Optimization Notice.

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.

Leave a Comment

Please sign in to add a comment. Not a member? Join today