@Reference(authors="N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger", title="The R*-tree: an efficient and robust access method for points and rectangles", booktitle="Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, May 23-25, 1990", url="http://dx.doi.org/10.1145/93597.98741") public class LeastOverlapInsertionStrategy extends Object implements InsertionStrategy
N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger:
The R*-tree: an efficient and robust access method for points and rectangles
in: Proceedings of the 1990 ACM SIGMOD International Conference on Management
of Data, Atlantic City, NJ, May 23-25, 1990
Modifier and Type | Class and Description |
---|---|
static class |
LeastOverlapInsertionStrategy.Parameterizer
Parameterization class.
|
Modifier and Type | Field and Description |
---|---|
static LeastOverlapInsertionStrategy |
STATIC
Static instance.
|
Constructor and Description |
---|
LeastOverlapInsertionStrategy()
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<A> int |
choose(A options,
ArrayAdapter<? extends SpatialComparable,A> getter,
SpatialComparable obj,
int height,
int depth)
Choose insertion rectangle.
|
public static final LeastOverlapInsertionStrategy STATIC
public LeastOverlapInsertionStrategy()
public <A> int choose(A options, ArrayAdapter<? extends SpatialComparable,A> getter, SpatialComparable obj, int height, int depth)
InsertionStrategy
choose
in interface InsertionStrategy
options
- Options to choose fromgetter
- Array adapter for optionsobj
- Insertion objectheight
- Tree heightdepth
- Insertion depth (depth == height - 1 indicates leaf level)Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.