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"
The STR is also mentioned here
-- Mateusz Loskot, http://mateusz.loskot.net
Geometry list run by mateusz at loskot.net