| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<RectangleEntryDist<T>> |
RectangleIndex.queryKNN(double[] center,
int k)
Finds the nearest neighbor.
|
QueryIteratorKNN<PointEntryDist<T>> |
PointIndexWrapper.queryKNN(double[] center,
int k) |
QueryIteratorKNN<PointEntryDist<T>> |
PointIndex.queryKNN(double[] center,
int k)
Finds the nearest neighbor.
|
QueryIteratorKNN<T> |
QueryIteratorKNN.reset(double[] center,
int k) |
| Modifier and Type | Class and Description |
|---|---|
class |
CoverTreeQueryKnn<T>
kNN search.
|
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
CoverTree.queryKNN(double[] center,
int k) |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
KDTree.queryKNN(double[] center,
int k) |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<RectangleEntryDist<T>> |
PHTreeR.queryKNN(double[] center,
int k) |
QueryIteratorKNN<PointEntryDist<T>> |
PHTreeP.queryKNN(double[] center,
int k) |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<RectangleEntryDist<T>> |
QuadTreeRKD.queryKNN(double[] center,
int k) |
QueryIteratorKNN<PointEntryDist<T>> |
QuadTreeKD.queryKNN(double[] center,
int k) |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
QuadTreeKD2.queryKNN(double[] center,
int k) |
| Modifier and Type | Class and Description |
|---|---|
class |
RTreeQueryKnn<T>
kNN search with EDGE distance and presorting of entries.
|
class |
RTreeQueryKnnOld<T>
kNN search with EDGE distance and presorting of entries.
|
Copyright © 2018. All rights reserved.