A simple and fast KD-tree for points in Python for kNN or nearest points. (damm short at just ~60 lines) No libraries needed.
-
Updated
Aug 23, 2022 - Python
A simple and fast KD-tree for points in Python for kNN or nearest points. (damm short at just ~60 lines) No libraries needed.
Add a description, image, and links to the boundedbox topic page so that developers can more easily learn about it.
To associate your repository with the boundedbox topic, visit your repo's landing page and select "manage topics."