Circle returns the indices of all points in the circle with the given center and radius.

NewBasicKDTree creates a BasicKDTree for the given points.

NewKDTree8 creates a KDTree8 for the given points.

NewLeafKDTree creates a LeafKDTree for the given points.

NewTrivialIndex returns a new TrivialIndex.

QuickSelect finds the kth smallest element in an unordered slice.

A BasicKDTree is a k-d tree for 2-D points that stores one point in each node.

A KDTree8 is a k-d tree for 2-D points that stores 8 points in each leaf node.

A LeafKDTree is a k-d tree for 2-D points that stores one point in each leaf node.

A TrivialIndex is an implementation of Index that doesn't actually speed up any operations.

An Index is a spatial index for a slice of points.