class

Crystalg::DataStructures::KDTree(T)

Inherits Crystalg::Geometry < Reference < Object

KD Tree is a data structure for organizing points in a k-dimensional space. KD Trees are a useful data structure for several applications, such as range searches and nearest neighbor searches.

Constructors

new(points : Array(Crystalg::Geometry::Point(T)))

Source

Instance methods

build(left, right, divx)

Source

count(bottom_left, top_right)

Source

nearest_neighbour(target)

Source