0

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.

Improve this question
0

2 Answers 2

Reset to default
2

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.

Improve this answer
Sign up to request clarification or add additional context in comments.

Comments

2

Ok, I'm assuming that the packing algorithm is only used during the creation.

Comment by Adam Wulkiewicz, one of the boost::geometry developers:

"There is only one packing algorithm implemented at the moment. So if you create the R-tree using packing algorithm always the same structure is created no matter which balancing algorithm was picked. But when you add or remove a value to/from this R-tree then choosen balancing algorithm is used"

Source: Serialize/de-serialize Boost.Geometry rtree

Improve this answer

2 Comments

Yup. I was going to find that info, but you found it already
If the same initial rtree can be used for all balancing algorithms, can we modify the balancing algorithm during execution?

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.