This project implements a k-dimensional tree data structure in C++. It is a space-partitioning data structure that organizes points in a k-dimensional space. It is useful for various applications such as nearest neighbor searches, range searches, and multidimensional data indexing.
- Dynamic point insertion
- Range search queries
- Support for arbitrary dimensions
- Support for arbitrary point types
Make sure you have the following installed on your system:
- GNU GCC (version 11+)
- CMake (version 3.10 or higher)
Simply include the header file in your program and you are done.