org.ddogleg.nn.alg
Interface KdTreeSearchN
-
- All Known Implementing Classes:
- KdTreeSearchNBbf, KdTreeSearchNStandard
public interface KdTreeSearchNInterface for searching a single tree for the N nearest-neighbors.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method and Description voidfindNeighbor(double[] target, int searchN, FastQueue<KdTreeResult> results)Searches for the N nearest-neighbors to the target.voidsetMaxDistance(double maxDistance)Specifies the maximum distance a closest-point needs to be to be consideredvoidsetTree(KdTree tree)Specifies the tree which is to be searched
-
-
-
Method Detail
-
setTree
void setTree(KdTree tree)
Specifies the tree which is to be searched
-
setMaxDistance
void setMaxDistance(double maxDistance)
Specifies the maximum distance a closest-point needs to be to be considered- Parameters:
maxDistance- maximum distance from target
-
findNeighbor
void findNeighbor(double[] target, int searchN, FastQueue<KdTreeResult> results)Searches for the N nearest-neighbors to the target. The results are added to the 'results' list.- Parameters:
target- Point whose nearest neighbor is being searched forsearchN- Number of closest points it will find. Must be>=1results- Storage for the found neighbors.
-
-
DataMelt 3.0 © DataMelt by jWork.ORG