Subject: Re: [boost] Fastest Data-structure maybe from STL or Boost ..!!
From: Andrew Hundt (athundt_at_[hidden])
Date: 2013-10-15 10:41:26
On Mon, Oct 14, 2013 at 11:22 PM, Sylvain Bougerel <
> > It's seems you need 2-dimensional sorting, one dimension for data, one
> time. I have a library that is written for this kind of real-time analysis
> in multi-dimension, it has k-d tree containers that are self re-balancing,
> with insertion in fractional amortized time. You can check it out here:
> I've been wanting to propose it for review on boost, but never got around
> to do it, cause I believe the documentation is sub-par.
How does this compare to the Spatial Indexes in Boost.Geometry?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk