Class KNearestNeighborSearchImpl
java.lang.Object
net.imglib2.kdtree.KNearestNeighborSearchImpl
k-nearest-neighbor search on
KDTreeImpl.
Results are node indices.-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate final int[]private final double[]private final int[]private final double[]private final intprivate final intprivate final intprivate final double[]private final KDTreeImpl -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionintbestIndex(int i) doublebestSquDistance(int i) copy()private voidinsert(double squDistance, int index) Insert index into list of best nodes.intk()void
-
Field Details
-
tree
-
numDimensions
private final int numDimensions -
numPoints
private final int numPoints -
pos
private final double[] pos -
k
private final int k -
bestSquDistance
private final double[] bestSquDistance -
bestIndex
private final int[] bestIndex -
axisDiffs
private final double[] axisDiffs -
awayChilds
private final int[] awayChilds
-
-
Constructor Details
-
KNearestNeighborSearchImpl
-
-
Method Details
-
insert
private void insert(double squDistance, int index) Insert index into list of best nodes. Also checks whether index will be inserted at all, that is, whether squDistance invalid input: '<' bestSquDistance[k-1] -
search
-
k
public int k() -
bestIndex
public int bestIndex(int i) -
bestSquDistance
public double bestSquDistance(int i) -
copy
-