Boost C++ Libraries of the most highly regarded and expertly designed C++ library projects in the world. Herb Sutter and Andrei Alexandrescu, C++ Coding Standards

This is the documentation for an old version of Boost. Click here to view this page for the latest version.

R*-tree creation algorithm parameters.


#include <boost/geometry/index/parameters.hpp>

template<size_t MaxElements,
         size_t MinElements = detail::default_min_elements_s<MaxElements>::value,
         size_t ReinsertedElements = detail::default_rstar_reinserted_elements_s<MaxElements>::value,
         size_t OverlapCostThreshold = 32>
struct rstar
  // ...
Template parameter(s)



size_t MaxElements

Maximum number of elements in nodes.

size_t MinElements

Minimum number of elements in nodes. Default: 0.3*Max.

size_t ReinsertedElements

The number of elements reinserted by forced reinsertions algorithm. If 0 forced reinsertions are disabled. Maximum value is Max+1-Min. Greater values are truncated. Default: 0.3*Max.

size_t OverlapCostThreshold

The number of most suitable leafs taken into account while choosing the leaf node to which currently inserted value will be added. If value is in range (0, MaxElements) - the algorithm calculates nearly minimum overlap cost, otherwise all leafs are analyzed and true minimum overlap cost is calculated. Default: 32.