R*-tree creation algorithm parameters - run-time version. More...
#include <parameters.hpp>
Public Member Functions | |
| 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) | |
| The constructor. More... | |
R*-tree creation algorithm parameters - run-time version.
|
inline |
The constructor.
| max_elements | Maximum number of elements in nodes. |
| min_elements | Minimum number of elements in nodes. Default: 0.3*Max. |
| 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. |
| 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. |
1.8.6