A KDTree (k-dimensional tree) is a binary tree used for organizing points in a k-dimensional space, allowing for efficient range searches and nearest neighbor searches.
import { KDTree } from "collection-kit";
import { KDTree } from "collection-kit";
const tree = new KDTree(2); // 2D space
tree.insert([2, 3]);
tree.insert([5, 4]);
tree.insert([9, 6]);
const nearest = tree.nearestNeighbor([5, 5]);
console.log("Nearest point:", nearest);