Boost C++ Libraries

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

PrevUpHomeNext
boost::geometry::index::dynamic_rstar
dynamic_rstar(size_t)

R*-tree creation algorithm parameters - run-time version.

Header

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

Synopsis
class dynamic_rstar
{
  // ...
};
Constructor(s) and destructor

Function

Description

dynamic_rstar(size_t)

The constructor.

The constructor.

Synopsis
dynamic_rstar(size_t max_elements,
              size_t min_elements = detail::default_min_elements_d(),
              size_t reinserted_elements = detail::default_rstar_reinserted_elements_d(),
              size_t overlap_cost_threshold = 32)
Parameter(s)

Type

Name

Description

size_t

max_elements

Maximum number of elements in nodes.

size_t

min_elements

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

size_t

reinserted_elements

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

size_t

overlap_cost_threshold

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.


PrevUpHomeNext