See: Description

| Interface | Description |
|---|---|
| InsertionStrategy |
RTree insertion strategy interface.
|
| Class | Description |
|---|---|
| ApproximativeLeastOverlapInsertionStrategy |
The choose subtree method proposed by the R*-Tree with slightly better
performance for large leaf sizes (linear approximation).
|
| ApproximativeLeastOverlapInsertionStrategy.Parameterizer |
Parameterization class.
|
| CombinedInsertionStrategy |
Use two different insertion strategies for directory and leaf nodes.
|
| CombinedInsertionStrategy.Parameterizer |
Parameterization class.
|
| LeastEnlargementInsertionStrategy |
The default R-Tree insertion strategy: find rectangle with least volume
enlargement.
|
| LeastEnlargementInsertionStrategy.Parameterizer |
Parameterization class.
|
| LeastEnlargementWithAreaInsertionStrategy |
A slight modification of the default R-Tree insertion strategy: find
rectangle with least volume enlargement, but choose least area on ties.
|
| LeastEnlargementWithAreaInsertionStrategy.Parameterizer |
Parameterization class.
|
| LeastOverlapInsertionStrategy |
The choose subtree method proposed by the R*-Tree for leaf nodes.
|
| LeastOverlapInsertionStrategy.Parameterizer |
Parameterization class.
|
Insertion strategies for R-Trees
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.