| Package | Description |
|---|---|
| de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants |
R*-Tree and variants.
|
| de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu | |
| de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query |
Queries on the R-Tree family of indexes: kNN and range queries.
|
| de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar | |
| de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d |
Visualizers based on 2D projections.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractRStarTreeFactory<O extends NumberVector<O,?>,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,I extends AbstractRStarTree<N,E> & Index>
Abstract factory for R*-Tree based trees.
|
| Modifier and Type | Class and Description |
|---|---|
class |
NonFlatRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>
Abstract superclass for all non-flat R*-Tree variants.
|
| Modifier and Type | Method and Description |
|---|---|
void |
AbstractRStarTreeNode.integrityCheck(AbstractRStarTree<N,E> tree)
Tests this node (for debugging purposes).
|
| Modifier and Type | Class and Description |
|---|---|
class |
DeLiCluTree
DeLiCluTree is a spatial index structure based on an R-TRee.
|
class |
DeLiCluTreeIndex<O extends NumberVector<?,?>>
The common use of the DeLiClu tree: indexing number vectors.
|
| Modifier and Type | Field and Description |
|---|---|
protected AbstractRStarTree<?,?> |
DoubleDistanceRStarTreeKNNQuery.tree
The index to use
|
protected AbstractRStarTree<?,?> |
DoubleDistanceRStarTreeRangeQuery.tree
The index to use
|
protected AbstractRStarTree<?,?> |
GenericRStarTreeRangeQuery.tree
The index to use
|
protected AbstractRStarTree<?,?> |
GenericRStarTreeKNNQuery.tree
The index to use
|
| Modifier and Type | Method and Description |
|---|---|
static <O extends SpatialComparable,D extends Distance<D>> |
RStarTreeUtil.getKNNQuery(AbstractRStarTree<?,?> tree,
SpatialDistanceQuery<O,D> distanceQuery,
Object... hints)
Get an RTree knn query, using an optimized double implementation when
possible.
|
static <O extends SpatialComparable,D extends Distance<D>> |
RStarTreeUtil.getRangeQuery(AbstractRStarTree<?,?> tree,
SpatialDistanceQuery<O,D> distanceQuery,
Object... hints)
Get an RTree range query, using an optimized double implementation when
possible.
|
| Constructor and Description |
|---|
DoubleDistanceRStarTreeKNNQuery(AbstractRStarTree<?,?> tree,
DistanceQuery<O,DoubleDistance> distanceQuery,
SpatialPrimitiveDoubleDistanceFunction<? super O> distanceFunction)
Constructor.
|
DoubleDistanceRStarTreeRangeQuery(AbstractRStarTree<?,?> tree,
DistanceQuery<O,DoubleDistance> distanceQuery,
SpatialPrimitiveDoubleDistanceFunction<? super O> distanceFunction)
Constructor.
|
GenericRStarTreeKNNQuery(AbstractRStarTree<?,?> tree,
SpatialDistanceQuery<O,D> distanceQuery)
Constructor.
|
GenericRStarTreeRangeQuery(AbstractRStarTree<?,?> tree,
SpatialDistanceQuery<O,D> distanceQuery)
Constructor.
|
| Modifier and Type | Class and Description |
|---|---|
class |
RStarTree
RStarTree is a spatial index structure based on the concepts of the R*-Tree.
|
class |
RStarTreeIndex<O extends NumberVector<?,?>>
The common use of the rstar tree: indexing number vectors.
|
| Modifier and Type | Field and Description |
|---|---|
protected AbstractRStarTree<N,E> |
TreeMBRVisualization.tree
The tree we visualize
|
| Modifier and Type | Method and Description |
|---|---|
private void |
TreeMBRVisualization.visualizeRTreeEntry(SVGPlot svgp,
Element layer,
Projection2D proj,
AbstractRStarTree<? extends N,E> rtree,
E entry,
int depth)
Recursively draw the MBR rectangles.
|
){kind=link}