Package org.tinspin.index.rtree

Class RTreeQueryKnn<T>

java.lang.Object

org.tinspin.index.rtree.RTreeQueryKnn<T>

Type Parameters:

T - Type Value type.

All Implemented Interfaces:

Iterator<RectangleEntryDist<T>>, QueryIteratorKNN<RectangleEntryDist<T>>

public class RTreeQueryKnn<T>
extends Object
implements QueryIteratorKNN<RectangleEntryDist<T>>

kNN search with EDGE distance and presorting of entries. Implementation after Hjaltason and Samet (with some deviations: no MinDist or MaxDist used). G. R. Hjaltason and H. Samet., "Distance browsing in spatial databases.", ACM TODS 24(2):265--318. 1999

Author:

Tilmann Zäschke

Constructor Summary

Constructors

Constructor	Description
RTreeQueryKnn(RTree<T> tree, double[] center, int k, RectangleDistanceFunction dist)

Method Summary

Modifier and Type	Method	Description
boolean	hasNext()
DistEntry<T>	next()
RTreeQueryKnn<T>	reset(double[] center, int k)
void	reset(double[] center, int k, RectangleDistanceFunction dist)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Iterator

forEachRemaining, remove

Constructor Detail

RTreeQueryKnn

public RTreeQueryKnn(RTree<T> tree,
                     double[] center,
                     int k,
                     RectangleDistanceFunction dist)

Method Detail

reset

public RTreeQueryKnn<T> reset(double[] center,
                              int k)

Specified by:

reset in interface QueryIteratorKNN<T>

reset

public void reset(double[] center,
                  int k,
                  RectangleDistanceFunction dist)

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<T>

next

public DistEntry<T> next()

Specified by:

next in interface Iterator<T>