Geometry Boost List: Re: [geometry] Rtree packing algorithm

Subject: Re: [geometry] Rtree packing algorithm
From: Mateusz Loskot (mateusz_at_[hidden])
Date: 2019-04-10 13:28:29

On Wed, 10 Apr 2019 at 15:21, Mateusz Loskot <mateusz_at_[hidden]> wrote:
> On Wed, 10 Apr 2019 at 15:14, shiva_acharya via Geometry <geometry_at_[hidden]> wrote:
> >
> > It's mentioned here that boost rtree range constructor uses packing
> > algorithm for the tree creation,
> > https://www.boost.org/doc/libs/1_65_1/libs/geometry/doc/html/geometry/reference/spatial_indexes/boost__geometry__index__rtree/rtree_range_const___.html
> >
> > Could someone please tell me specifically which packing algorithm is used in boost rtree?
> > If you can provide some implementation details as well it would be really helpful.
>
> For both, I'd apply "Read the code, Luke" approach:
>
> "This algorithm is something between STR and TGS"
> https://github.com/boostorg/geometry/blob/f2d5fae490372621e64063b4f545f5cf2f2f8c04/include/boost/geometry/index/detail/rtree/pack_create.hpp#L112

The STR is also mentioned here
https://www.boost.org/doc/libs/1_69_0/libs/geometry/doc/html/geometry/spatial_indexes/introduction.html

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