| Package | Description | 
|---|---|
| de.lmu.ifi.dbs.elki.algorithm | Algorithms suitable as a task for the  KDDTaskmain routine. | 
| de.lmu.ifi.dbs.elki.algorithm.clustering | Clustering algorithms
 
 Clustering algorithms are supposed to implement the  Algorithm-Interface. | 
| de.lmu.ifi.dbs.elki.index.preprocessed.knn | Indexes providing KNN and rKNN data. | 
| de.lmu.ifi.dbs.elki.index.tree.spatial | Tree-based index structures for spatial indexing. | 
| 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.index.tree.spatial.rstarvariants.util | Utilities for R*-Tree and variants. | 
| de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d | Visualizers based on 2D projections. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | KNNJoin<V extends NumberVector<V,?>,D extends Distance<D>,N extends SpatialNode<N,E>,E extends SpatialEntry>Joins in a given spatial database to each object its k-nearest neighbors. | 
| static class  | KNNJoin.Parameterizer<V extends NumberVector<V,?>,D extends Distance<D>,N extends SpatialNode<N,E>,E extends SpatialEntry>Parameterization class. | 
| Modifier and Type | Field and Description | 
|---|---|
| (package private) SpatialEntry | DeLiClu.SpatialObjectPair. entry1The first entry of this pair. | 
| (package private) SpatialEntry | DeLiClu.SpatialObjectPair. entry2The second entry of this pair. | 
| Constructor and Description | 
|---|
| DeLiClu.SpatialObjectPair(D distance,
                         SpatialEntry entry1,
                         SpatialEntry entry2,
                         boolean isExpandable)Creates a new entry with the specified parameters. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | SpatialApproximationMaterializeKNNPreprocessor<O extends NumberVector<?,?>,D extends Distance<D>,N extends SpatialNode<N,E>,E extends SpatialEntry>A preprocessor for annotation of the k nearest neighbors (and their
 distances) to each database object. | 
| static class  | SpatialApproximationMaterializeKNNPreprocessor.Factory<D extends Distance<D>,N extends SpatialNode<N,E>,E extends SpatialEntry>The actual preprocessor instance. | 
| static class  | SpatialApproximationMaterializeKNNPreprocessor.Factory.Parameterizer<D extends Distance<D>,N extends SpatialNode<N,E>,E extends SpatialEntry>Parameterization class. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | SpatialIndexTree<N extends SpatialNode<N,E>,E extends SpatialEntry>Abstract super class for all spatial index tree classes. | 
| interface  | SpatialNode<N extends SpatialNode<N,E>,E extends SpatialEntry>Defines the requirements for an object that can be used as a node in a
 Spatial Index. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | SpatialDirectoryEntryRepresents an entry in a directory node of a spatial index. | 
| class  | SpatialPointLeafEntryRepresents an entry in a leaf node of a spatial index. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | AbstractRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>Abstract superclass for index structures based on a R*-Tree. | 
| 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. | 
| class  | AbstractRStarTreeNode<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>Abstract superclass for nodes in a R*-Tree. | 
| class  | NonFlatRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>Abstract superclass for all non-flat R*-Tree variants. | 
| Modifier and Type | Field and Description | 
|---|---|
| (package private) E | AbstractRStarTree. lastInsertedEntryThe last inserted entry | 
| Modifier and Type | Interface and Description | 
|---|---|
| interface  | DeLiCluEntryDefines the requirements for an entry in an DeLiClu-Tree node. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | DeLiCluDirectoryEntryDefines the requirements for a directory entry in an DeLiClu-Tree node. | 
| class  | DeLiCluLeafEntryDefines the requirements for a leaf entry in an DeLiClu-Tree node. | 
| Modifier and Type | Method and Description | 
|---|---|
| Set<Integer> | DeLiCluTree. getExpanded(SpatialEntry entry)Returns the nodes which are already expanded with the specified node. | 
| void | DeLiCluTree. setExpanded(SpatialEntry entry1,
           SpatialEntry entry2)Marks the nodes with the specified ids as expanded. | 
| Modifier and Type | Field and Description | 
|---|---|
| (package private) SpatialEntry | DoubleDistanceRStarTreeKNNQuery.DoubleDistanceEntry. entryReferenced entry | 
| Modifier and Type | Method and Description | 
|---|---|
| protected List<DistanceEntry<D,SpatialEntry>> | GenericRStarTreeKNNQuery. getSortedEntries(AbstractRStarTreeNode<?,?> node,
                DBIDs ids)Sorts the entries of the specified node according to their minimum distance
 to the specified objects. | 
| Constructor and Description | 
|---|
| DoubleDistanceRStarTreeKNNQuery.DoubleDistanceEntry(SpatialEntry entry,
                                                   double distance)Constructor. | 
| Modifier and Type | Method and Description | 
|---|---|
| protected SpatialEntry | RStarTree. createNewDirectoryEntry(RStarTreeNode node) | 
| protected SpatialEntry | RStarTree. createRootEntry() | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | Enlargement<E extends SpatialEntry>Encapsulates the parameters for enlargement of nodes after insertion of new
 objects. | 
| private class  | TopologicalSplitter.Split<E extends SpatialEntry>Internal data for an actual split. | 
| Modifier and Type | Method and Description | 
|---|---|
| <N extends Node<E>,E extends SpatialEntry>  | ApproximateLeastOverlapInsertionStrategy. findInsertChild(N node,
               SpatialComparable mbr)Returns the path information of the entry of the specified node which needs
 least overlap enlargement if the given mbr would be inserted into. | 
| <N extends Node<E>,E extends SpatialEntry>  | InsertionStrategy. findInsertChild(N node,
               SpatialComparable mbr)Find the child to insert into. | 
| <N extends Node<E>,E extends SpatialEntry>  | LeastOverlapInsertionStrategy. findInsertChild(N node,
               SpatialComparable mbr)Returns the path information of the entry of the specified node which needs
 least overlap enlargement if the given mbr would be inserted into. | 
| <E extends SpatialEntry>  | TopologicalSplitter. split(List<E> entries,
     int minEntries) | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | TreeMBRVisualization<NV extends NumberVector<NV,?>,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>Visualize the bounding rectangles of an R-Tree based index. |