Documentation
¶
Overview ¶
Package dkdtree implements a disk-backed kd-tree for datasets too large for memory.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type PointDistance ¶
type Tree ¶
type Tree struct {
// contains filtered or unexported fields
}
func (*Tree) NearestExhaustive ¶
func (t *Tree) NearestExhaustive(p Point, n int) ([]PointDistance, error)
NearestExhaustive just scans every point. This might be faster if your data has high dimensionality.
Click to show internal directories.
Click to hide internal directories.