class Crystalg::DataStructures::KDTree(T)

Overview

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.

Included Modules

Defined in:

crystalg/data_structures/kdtree.cr

Constructors

Instance Method Summary

Instance methods inherited from module Crystalg::Geometry

counter_clockwise(a : Point, b : Point, c : Point) : CCW counter_clockwise

Constructor Detail

def self.new(points : Array(Crystalg::Geometry::Point(T))) #

[View source]

Instance Method Detail

def build(left, right, divx) #

[View source]
def count(bottom_left, top_right) #

[View source]
def nearest_neighbour(target) #

[View source]