KD-Tree

#include "KD-Tree/kd_tree.h"
#include <vector>
#include <array>

// Define 2D points
using Point2D = std::array<double, 2>;

// Create a set of 2D points
std::vector<Point2D> points = {
    {1.0, 2.0},
    {3.0, 4.0},
    {5.0, 1.0},
    {7.0, 6.0},
    {2.0, 8.0}
};

// Build KD-tree for 2D space
kd_tree<Point2D, 2> tree(&points);

// Query point
Point2D query = {3.5, 4.5};

// Find all points within radius 2.0
std::vector<std::size_t> neighbors = tree.radius_search(query, 2.0);

// neighbors contains indices of points within distance 2.0 from query
for (std::size_t idx : neighbors) {
    // Process neighbor points[idx]
}

#include "KD-Tree/kd_tree.h"
#include <vector>
#include <array>

// Define 3D points
using Point3D = std::array<double, 3>;

std::vector<Point3D> points_3d = {
    {1.0, 2.0, 3.0},
    {4.0, 5.0, 6.0},
    {7.0, 8.0, 9.0}
};

// Build KD-tree for 3D space
kd_tree<Point3D, 3> tree_3d(&points_3d);

// Radius search in 3D
Point3D query_3d = {4.5, 5.5, 6.5};
auto results = tree_3d.radius_search(query_3d, 1.5);