I understand TBB is capable to treat recursive algorithm in a parallel manner,
which enable parallel quick sorting.
Therefore, is TBB suitable to spatial indexing algorithm such as R-Tree,
or are there libraries for it to utilize TBB?
I am looking for parallel fastest library of spatial indexing and nn searching.
Nowadays, many researchers cope with parallel algorithms to build Bounding Volume Hierarchies in GPU.
(c.f. "Fast Parallel Construction of High-Quality Bounding Volume Hierarchies")
I believe TBB is more suited to such a applicatons, AABB tree or so.
If you know the implementation or benefits of parallel spatial indexing by means of TBB,
I would appreciate it if you could tell me.