org.ddogleg.nn.alg

Class KdTreeSearchNStandard

java.lang.Object

org.ddogleg.nn.alg.KdTreeSearchNStandard

All Implemented Interfaces:

KdTreeSearchN

public class KdTreeSearchNStandard
extends java.lang.Object
implements KdTreeSearchN

Standard algorithm for searching a KdTree for the nearest-neighbor of a search. This is an adaptation of KdTreeSearch1Standard for N-nearest-neighbors.

Constructor Summary

Constructors

Constructor and Description
KdTreeSearchNStandard()

Method Summary

Modifier and Type	Method and Description
void	findNeighbor(double[] target, int searchN, FastQueue<KdTreeResult> results) Finds the nodes which are closest to 'target' and within range of the maximum distance.
void	setMaxDistance(double maxDistance) Specifies the greatest distance it will search
void	setTree(KdTree tree) Specifies the tree which is to be searched

Methods inherited from class java.lang.Object

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

Constructor Detail

KdTreeSearchNStandard

public KdTreeSearchNStandard()

Method Detail

setTree

public void setTree(KdTree tree)

Description copied from interface: KdTreeSearchN

Specifies the tree which is to be searched

Specified by:

setTree in interface KdTreeSearchN

setMaxDistance

public void setMaxDistance(double maxDistance)

Specifies the greatest distance it will search

Specified by:

setMaxDistance in interface KdTreeSearchN

Parameters:

maxDistance - Maximum distance (Euclidean squared) a closest point can be

findNeighbor

public void findNeighbor(double[] target,
                         int searchN,
                         FastQueue<KdTreeResult> results)

Finds the nodes which are closest to 'target' and within range of the maximum distance.

Specified by:

findNeighbor in interface KdTreeSearchN

Parameters:

target - A point

searchN - Number of nearest-neighbors it will search for

results - Storage for the found neighbors