| Package | Description |
|---|---|
| org.tinspin.index | |
| org.tinspin.index.covertree | |
| org.tinspin.index.kdtree | |
| org.tinspin.index.phtree | |
| org.tinspin.index.qthypercube | |
| org.tinspin.index.qthypercube2 |
| Modifier and Type | Method and Description |
|---|---|
PointEntryDist<T> |
PointIndexWrapper.query1NN(double[] center) |
default PointEntryDist<T> |
PointIndex.query1NN(double[] center)
Finds the nearest neighbor.
|
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
PointIndexWrapper.queryKNN(double[] center,
int k) |
QueryIteratorKNN<PointEntryDist<T>> |
PointIndex.queryKNN(double[] center,
int k)
Finds the nearest neighbor.
|
| Modifier and Type | Class and Description |
|---|---|
class |
PointDist<T> |
| Modifier and Type | Method and Description |
|---|---|
PointEntryDist<T> |
CoverTree.query1NN(double[] center) |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
CoverTree.queryKNN(double[] center,
int k) |
| Modifier and Type | Class and Description |
|---|---|
class |
KDEntryDist<T> |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
KDTree.queryKNN(double[] center,
int k) |
| Modifier and Type | Class and Description |
|---|---|
class |
DistEntryP<T> |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
PHTreeP.queryKNN(double[] center,
int k) |
| Modifier and Type | Class and Description |
|---|---|
class |
QEntryDist<T> |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
QuadTreeKD.queryKNN(double[] center,
int k) |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<PointEntryDist<T>> |
QuadTreeKD2.queryKNN(double[] center,
int k) |
Copyright © 2018. All rights reserved.