Package elki.index.tree.spatial.kd
K-d-tree and variants.
-
Interface Summary Interface Description PartialDistance<O> Interface to maintain partial distance bounds. -
Class Summary Class Description MemoryKDTree<O extends NumberVector> Implementation of a static in-memory K-D-tree.MemoryKDTree.Factory<O extends NumberVector> Factory classMemoryKDTree.Factory.Par<O extends NumberVector> Parameterization class.MemoryKDTree.KDNode KD tree node.MemoryKDTree.PrioritySearchBranch Search position for priority search.MinimalisticMemoryKDTree<O extends NumberVector> Simple implementation of a static in-memory K-D-tree.MinimalisticMemoryKDTree.CountSortAccesses Class to count object accesses during construction.MinimalisticMemoryKDTree.Factory<O extends NumberVector> Factory classMinimalisticMemoryKDTree.Factory.Par<O extends NumberVector> Parameterization class.MinimalisticMemoryKDTree.PrioritySearchBranch Search position for priority search.PartialEuclideanDistance Partial distance computations for Euclidean distance.PartialLPNormDistance Partial distance computations for Euclidean distance.PartialManhattanDistance Partial distance computations for Euclidean distance.PartialSquaredEuclideanDistance Partial distance computations for squared Euclidean distance.SmallMemoryKDTree<O extends NumberVector> Simple implementation of a static in-memory K-D-tree.SmallMemoryKDTree.Factory<O extends NumberVector> Factory classSmallMemoryKDTree.Factory.Par<O extends NumberVector> Parameterization class.SmallMemoryKDTree.PrioritySearchBranch Search position for priority search.