kdtree-jk

MIT

KD-TREE package for searching for nearest neighbors in N points in in M-dimensions in N log(N) time.

$ area51 add kdtree-jkCopy

Usage

;; area51 add updates your .asd automatically.
;; Use the package in your code:
(in-package :my-project)
(kdtree-jk:some-function ...)