Uses of Class
org.ddogleg.nn.alg.KdTree.Node

Packages that use KdTree.Node

Package	Description
org.ddogleg.nn.alg
org.ddogleg.nn.alg.searches

Uses of KdTree.Node in org.ddogleg.nn.alg

Fields in org.ddogleg.nn.alg declared as KdTree.Node

Modifier and Type	Field	Description
@Nullable KdTree.Node	KdTree.Node.left	Branch ≤ point[split]
KdTree.Node	KdTreeResult.node
@Nullable KdTree.Node	KdTree.Node.right	Branch ≥ point[split]
@Nullable KdTree.Node	KdTree.root

Fields in org.ddogleg.nn.alg with type parameters of type KdTree.Node

Modifier and Type	Field	Description
protected List<KdTree.Node>	KdTreeMemory.open
protected List<KdTree.Node>	KdTreeMemory.unusedNodes

Methods in org.ddogleg.nn.alg that return KdTree.Node

Modifier and Type	Method	Description
protected KdTree.Node	KdTreeConstructor.computeBranch(List<P> points, @Nullable DogArray_I32 indexes)	Given the data inside this particular node, select a point for the node and compute the node's children
protected KdTree.Node	KdTreeConstructor.computeChild(List<P> points, @Nullable DogArray_I32 indexes)	Creates a child by checking to see if it is a leaf or branch.
KdTree.Node	KdTreeSearch1.findNeighbor(P target)	Searches for the nearest neighbor to the target.
KdTree.Node	KdTreeMemory.requestNode()	Returns a new node.
KdTree.Node	KdTreeMemory.requestNode(P point, int index)	Request a leaf node be returned.

Methods in org.ddogleg.nn.alg with parameters of type KdTree.Node

Modifier and Type	Method	Description
void	KdTreeMemory.recycle(KdTree.Node node)

Uses of KdTree.Node in org.ddogleg.nn.alg.searches

Methods in org.ddogleg.nn.alg.searches that return KdTree.Node

Modifier and Type	Method	Description
KdTree.Node	KdTreeSearch1Bbf.findNeighbor(P target)
KdTree.Node	KdTreeSearch1Standard.findNeighbor(P target)	Finds the node which is closest to 'target'

Methods in org.ddogleg.nn.alg.searches with parameters of type KdTree.Node

Modifier and Type	Method	Description
protected void	KdTreeSearchBestBinFirst.addToQueue(double closestDistanceSq, KdTree.Node node, P target)	Adds a node to the priority queue.
protected void	KdTreeSearch1Bbf.checkBestDistance(KdTree.Node node, P target)	Checks to see if the current node's point is the closet point found so far
protected abstract void	KdTreeSearchBestBinFirst.checkBestDistance(KdTree.Node node, P target)	Checks to see if the current node's point is the closet point found so far
protected void	KdTreeSearchNBbf.checkBestDistance(KdTree.Node node, P target)	Checks to see if the current node's point is the closet point found so far
protected void	KdTreeSearchBestBinFirst.searchNode(P target, KdTree.Node n)	Traverse a node down to a leaf.