Class RTreeQuadraticSplit
- java.lang.Object
-
- elki.index.tree.spatial.rstarvariants.strategies.split.RTreeQuadraticSplit
-
- All Implemented Interfaces:
SplitStrategy
@Reference(authors="A. Guttman", title="R-Trees: A Dynamic Index Structure For Spatial Searching", booktitle="Proc. 1984 ACM SIGMOD Int. Conf. on Management of Data", url="https://doi.org/10.1145/971697.602266", bibkey="doi:10.1145/971697.602266") public class RTreeQuadraticSplit extends java.lang.Object implements SplitStrategy
Quadratic-time complexity greedy split as used by the original R-Tree.Reference:
A. Guttman
R-Trees: A Dynamic Index Structure For Spatial Searching
Proc. 1984 ACM SIGMOD Int. Conf. Management of Data- Since:
- 0.5.0
- Author:
- Erich Schubert
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
RTreeQuadraticSplit.Par
Parameterization class.
-
Field Summary
Fields Modifier and Type Field Description static RTreeQuadraticSplit
STATIC
Static instance.
-
Constructor Summary
Constructors Constructor Description RTreeQuadraticSplit()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description <E extends SpatialComparable,A>
long[]split(A entries, ArrayAdapter<E,A> getter, int minEntries)
Split a page
-
-
-
Field Detail
-
STATIC
public static final RTreeQuadraticSplit STATIC
Static instance.
-
-
Method Detail
-
split
public <E extends SpatialComparable,A> long[] split(A entries, ArrayAdapter<E,A> getter, int minEntries)
Description copied from interface:SplitStrategy
Split a page- Specified by:
split
in interfaceSplitStrategy
- Parameters:
entries
- Entries to splitgetter
- Adapter for the entries arrayminEntries
- Minimum number of entries in each part- Returns:
- BitSet containing the assignment.
-
-