KD Tree Nearest Neighbor and Range Search
This implements a KDTree for nearest neighbor and range searching.The KDTree stores a N-dimensional set of points. The tree can be queried for all points within a Euclidian range in order O(sqrt(p)+k) time, where p is the number of points and k is the number of reported points. A nearest neighbor search can be done in order O(log(p) time. The m-files are binary MATLAB functions written in C++. Source code is included as well as binaries for Linux on i386 and x86_64 systems and Windows (i386).
Cite As
Steven Michael (2024). KD Tree Nearest Neighbor and Range Search (https://www.mathworks.com/matlabcentral/fileexchange/7030-kd-tree-nearest-neighbor-and-range-search), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Acknowledgements
Inspired: Efficient Kernel Smoothing Regression using KD-Tree, Efficient K-Nearest Neighbor Search using JIT, ataiya/kdtree, Kdtree implementation in matlab
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
kdtree/@kdtree/
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 | Update to compile with MATLAB R2008a. Change to makefile-based Visual Studio solution for windows. |