JavaScript is disabled on your browser.
Classes in org.ddogleg.nn.alg used by org.ddogleg.nn.alg
Class
Description
AxisSplitRule
Selects which axis the data should be split along when given a list of variances.
AxisSplitter
Selects which dimension the set of points should be split by, which point is used to split the lists, and splits
the lists into two sets.
KdTree
K-D Tree is short for k-dimensional tree and is a binary tree data structure used for quickly finding the
nearest-neighbor of a k-dimensional point in a set.
KdTree.Node
Data type for each node in the binary tree.
KdTreeDistance
Computes the distance between two points.
KdTreeMemory
Memory management for recycling KdTree data structures.
KdTreeResult
Storage for the results of a K-D Tree search.
KdTreeSearch1
Interface for searching a single tree for the nearest-neighbor
KdTreeSearchN
Interface for searching a single tree for the N nearest-neighbors.
Classes in org.ddogleg.nn.alg used by org.ddogleg.nn.alg.searches
Class
Description
KdTree
K-D Tree is short for k-dimensional tree and is a binary tree data structure used for quickly finding the
nearest-neighbor of a k-dimensional point in a set.
KdTree.Node
Data type for each node in the binary tree.
KdTreeDistance
Computes the distance between two points.
KdTreeResult
Storage for the results of a K-D Tree search.
KdTreeSearch1
Interface for searching a single tree for the nearest-neighbor
KdTreeSearchN
Interface for searching a single tree for the N nearest-neighbors.