Re: [boost] Fastest Data-structure maybe from STL or Boost ..!!

Subject: Re: [boost] Fastest Data-structure maybe from STL or Boost ..!!
From: Mateusz Loskot (mateusz_at_[hidden])
Date: 2013-10-15 12:35:01

On 15 October 2013 15:41, Andrew Hundt <athundt_at_[hidden]> wrote:
> On Mon, Oct 14, 2013 at 11:22 PM, Sylvain Bougerel <
> sylvain.bougerel.devel_at_[hidden]> wrote:
>
>>
>> > It's seems you need 2-dimensional sorting, one dimension for data, one
>> for
>> 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:
>> http://spatial.sourceforge.net/
>>
>> 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?
>
> http://www.boost.org/doc/libs/1_54_0/libs/geometry/doc/html/geometry/spatial_indexes.html

Currently, BG Spatial Index implements only R-tree, so it roughly compares
as k-d tree vs R-tree.

BG list may be helpful to discuss more details
http://lists.boost.org/mailman/listinfo.cgi/geometry

Best regards,
-- 
Mateusz  Loskot, http://mateusz.loskot.net