Defines how points are inserted into an r-tree.
Different strategies try to minimize both insertion time (how long does it take to add a new object into the tree?) and querying time (how long does an average nearest neighbor query take?). Currently, only one insertion strategy is implemented: R* (R-star) insertion. R* insertion tries to minimize querying performance while yielding reasonable insertion times, making it a good default strategy. More strategies might be implemented in the future.
Only calls to insert are affected by this strategy.
This trait is not meant to be implemented by the user.