This is a Python implementation of cover trees, a data structure for finding nearest neighbors in a general metric space (e.g., a 3D box with periodic boundary conditions). Cover trees are described in two papers hosted here: http://hunch.net/~jl/projects/cover_tree/cover_tree.html The implementation here owes a great deal to PyCoverTree, by Thomas Kollar, Nil Geisweiller, Emanuele Olivetti, which can be found here: http://github.com/emanuele/PyCoverTree The API follows that of Anne M. Archibald's KD-tree implementation for scipy (scipy.spatial.kdtree). Other than specifying a distance function in the constructor, this module can be used as a drop-in replacement for kdtree.
You might also like...
Print a directory tree structure in your Python code
Print a directory tree structure in your Python code
Deep learning prediction of protein complex structure quality
Deep learning prediction of protein complex structure quality
(educational) build your own disk based KV store
(educational) build your own disk based KV store
An easy to use program for creating Maplestory Beast Tamer skill tree
An easy to use program for creating Maplestory Beast Tamer skill tree
Pie - A loose structured python project manager
Pie - A loose structured python project manager
A simple vault structure using OP_CTV
A simple vault structure using OP_CTV
Binary Ninja plugin for exploring Structured Exception Handlers
Binary Ninja plugin for exploring Structured Exception Handlers
A tiny log-structured key-value database written in pure Python
A tiny log-structured key-value database written in pure Python.