c++performanceboostr-tree

boost r-tree packing algorithm during insertion

The question is about the boost::geometry::index::rtree:

I know that the constructor: rtree(Iterator, Iterator) will create the tree using the packing algorithm, as stated in the documentation. I'm wondering whether the insertion which accepts the iterators: insert(Iterator, Iterator) will also use the packing algorithm.

Thanks.

Solution

  • The packing algorithm is used if the R-tree is created from items given to the constructor. The balancing algorithm is used during splitting of nodes i.e. on insert() and remove().

    So the answer is no. During insertion the packing algorithm is ignored.