Package com.savarese.spatial

Spatial data structures.

See:
Description

Interface Summary

Distance<Coord extends Number & Comparable<? super Coord>,P extends Point<Coord>>	The Distance interface encapsulates an algorithm for determining the distance between two points.
NearestNeighbors.Entry<Coord extends Number & Comparable<? super Coord>,P extends Point<Coord>,V>	The Entry interface makes accessible the results of a NearestNeighbors search.
Point<Coord extends Comparable<? super Coord>>	The Point interface represents a point in a k-dimensional space.
RangeSearchTree<Coord extends Comparable<? super Coord>,P extends Point<Coord>,V>	A RangeSearchTree is a spatial data structure that supports the retrieval of data associated with point keys as well as the searching of data that occurs within a specified range of points.

Class Summary

EuclideanDistance<Coord extends Number & Comparable<? super Coord>,P extends Point<Coord>>	The EuclideanDistance class determines the distance between two points in a Euclidean space.
GenericPoint<Coord extends Comparable<? super Coord>>	A Point implementation supporting k dimensions.
KDTree<Coord extends Comparable<? super Coord>,P extends Point<Coord>,V>	A k-d tree divides a k-dimensional space relative to the points it contains by storing them in a binary tree, discriminating by a different dimension at each level of the tree.
NearestNeighbors<Coord extends Number & Comparable<? super Coord>,P extends Point<Coord>,V>	NearestNeighbors implements an algorithm for finding the k-nearest neighbors to a query point within the set of points contained by a KDTree instance.

Package com.savarese.spatial Description

Spatial data structures. This package contains spatial data structures and algorithms.