Uses of Interface
de.lmu.ifi.dbs.elki.index.tree.spatial.SpatialEntry

Packages that use SpatialEntry
de.lmu.ifi.dbs.elki.algorithm Algorithms suitable as a task for the KDDTask main 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 DeLiCluTree 
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 RStarTree 
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. 
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.algorithm
 

Classes in de.lmu.ifi.dbs.elki.algorithm with type parameters of type SpatialEntry
 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.
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.algorithm.clustering
 

Fields in de.lmu.ifi.dbs.elki.algorithm.clustering declared as SpatialEntry
(package private)  SpatialEntry DeLiClu.SpatialObjectPair.entry1
          The first entry of this pair.
(package private)  SpatialEntry DeLiClu.SpatialObjectPair.entry2
          The second entry of this pair.
 

Constructors in de.lmu.ifi.dbs.elki.algorithm.clustering with parameters of type SpatialEntry
DeLiClu.SpatialObjectPair(D distance, SpatialEntry entry1, SpatialEntry entry2, boolean isExpandable)
          Creates a new entry with the specified parameters.
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.index.preprocessed.knn
 

Classes in de.lmu.ifi.dbs.elki.index.preprocessed.knn with type parameters of type SpatialEntry
 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.
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.index.tree.spatial
 

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial with type parameters of type SpatialEntry
 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.
 

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial that implement SpatialEntry
 class SpatialDirectoryEntry
          Represents an entry in a directory node of a spatial index.
 class SpatialPointLeafEntry
          Represents an entry in a leaf node of a spatial index.
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants
 

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants with type parameters of type SpatialEntry
 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.
 

Fields in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants declared as SpatialEntry
(package private)  E AbstractRStarTree.lastInsertedEntry
          The last inserted entry
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu
 

Subinterfaces of SpatialEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu
 interface DeLiCluEntry
          Defines the requirements for an entry in an DeLiClu-Tree node.
 

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu that implement SpatialEntry
 class DeLiCluDirectoryEntry
          Defines the requirements for a directory entry in an DeLiClu-Tree node.
 class DeLiCluLeafEntry
          Defines the requirements for a leaf entry in an DeLiClu-Tree node.
 

Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu with parameters of type SpatialEntry
 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.
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query
 

Fields in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query declared as SpatialEntry
(package private)  SpatialEntry DoubleDistanceRStarTreeKNNQuery.DoubleDistanceEntry.entry
          Referenced entry
 

Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query that return types with arguments of type SpatialEntry
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.
 

Constructors in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query with parameters of type SpatialEntry
DoubleDistanceRStarTreeKNNQuery.DoubleDistanceEntry(SpatialEntry entry, double distance)
          Constructor.
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar
 

Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar that return SpatialEntry
protected  SpatialEntry RStarTree.createNewDirectoryEntry(RStarTreeNode node)
           
protected  SpatialEntry RStarTree.createRootEntry()
           
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util
 

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util with type parameters of type SpatialEntry
 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.
 

Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util with type parameters of type SpatialEntry
<N extends Node<E>,E extends SpatialEntry>
TreeIndexPathComponent<E>
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>
TreeIndexPathComponent<E>
InsertionStrategy.findInsertChild(N node, SpatialComparable mbr)
          Find the child to insert into.
<N extends Node<E>,E extends SpatialEntry>
TreeIndexPathComponent<E>
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>
Pair<List<E>,List<E>>
TopologicalSplitter.split(List<E> entries, int minEntries)
           
 

Uses of SpatialEntry in de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d
 

Classes in de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d with type parameters of type SpatialEntry
 class TreeMBRVisualization<NV extends NumberVector<NV,?>,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>
          Visualize the bounding rectangles of an R-Tree based index.
 


Release 0.4.0 (2011-09-20_1324)