Re: [Boost-users] [Geometry] Packing algorithm for r-tree?

Subject: Re: [Boost-users] [Geometry] Packing algorithm for r-tree?
From: Jeremy Murphy (jeremy.william.murphy_at_[hidden])
Date: 2014-10-27 06:11:42

On 27 October 2014 00:34, Adam Wulkiewicz <adam.wulkiewicz_at_[hidden]> wrote:

> Hi,
>
> Jeremy Murphy wrote:
>
>>
>> I see that a fourth node splitting algorithm for bulk loading is
>> documented in the Introduction to spatial indexes but not listed elsewhere
>> (such as Creation and Modification).
>> Is it hiding in the library somewhere or is the introduction just a
>> tantalizing sneak preview?
>>
>
> The packing algorithm is used if the R-tree is created with a constructor
> taking a range e.g. as a pair of Iterators:
>
> http://www.boost.org/doc/libs/1_56_0/libs/geometry/doc/html/
> geometry/reference/spatial_indexes/boost__geometry__
> index__rtree/rtree_iterator__iterator_.html
>
> Yes, maybe it should be explicitly stated in the "Creation..." section.

Ah, fantastic.  Hah, turns out I was already using that constructor.
So what should I write as the second required template parameter, which is
usually linear<N>, quadratic<N>, etc?  Is it just ignored in the packing
case?  If so, that's a bit confusing.
Thanks, cheers.

Jeremy