Fast kd-tree implementation with OpenMP-enabled queries (Python 2 version)
Descriptionpykdtree is a kd-tree implementation for fast nearest neighbour search in Python. The aim is to be the fastest implementation around for common use cases (low dimensions and low number of neighbours) for both tree construction and queries. The implementation is based on scipy.spatial.cKDTree and libANN by combining the best features from both and focus on implementation efficiency. The interface is similar to that of scipy.spatial.cKDTree except only Euclidean distance measure is supported. Queries are optionally multithreaded using OpenMP. This is the Python 2 version of the package.
Upload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.Upload a screenshot
Hint: upload an image here from your clipboard with Ctrl-V
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…Install python-pykdtree