Uses of Package
org.ddogleg.nn.alg
Packages that use org.ddogleg.nn.alg
Package
Description
-
Classes in org.ddogleg.nn.alg used by org.ddogleg.nn
-
Classes in org.ddogleg.nn.alg used by org.ddogleg.nn.algClassDescriptionSelects which axis the data should be split along when given a list of variances.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.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.Data type for each node in the binary tree.Computes the distance between two points.Memory management for recycling KdTree data structures.Storage for the results of a K-D Tree search.Interface for searching a single tree for the nearest-neighborInterface for searching a single tree for the N nearest-neighbors.
-
Classes in org.ddogleg.nn.alg used by org.ddogleg.nn.alg.distance
-
Classes in org.ddogleg.nn.alg used by org.ddogleg.nn.alg.searchesClassDescriptionK-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.Data type for each node in the binary tree.Computes the distance between two points.Storage for the results of a K-D Tree search.Interface for searching a single tree for the nearest-neighborInterface for searching a single tree for the N nearest-neighbors.
-
Classes in org.ddogleg.nn.alg used by org.ddogleg.nn.wrapClassDescriptionSelects 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.Computes the distance between two points.Interface for searching a single tree for the nearest-neighborInterface for searching a single tree for the N nearest-neighbors.