KD-Tree: A Commonly Used Data Structure for Efficient Nearest Neighbor Search

KD-Tree is a widely adopted data structure particularly useful for nearest neighbor searches. This repository contains pure MATLAB source code that demonstrates KD-Tree implementation, construction methods, and search algorithms.