kdtree/main.cpp

#include "kdtree.h"
#include <iostream>

int main() {
    std::cout << "Hello World!" << std::endl;

    // Test points
    std::vector<Point *> points{new Point(new float[3]{0.0, 0.0, 0.0}, nullptr),
                                new Point(new float[3]{0.0, 1.0, 0.0}, nullptr),
                                new Point(new float[3]{0.0, 2.0, 3.0}, nullptr),
                                new Point(new float[3]{1.0, 0.0, 4.0}, nullptr),
                                new Point(new float[3]{1.0, -1.0, 8.0}, nullptr)};

    KDTree tree = KDTree(points);

    std::cout << tree.to_string();

    tree.intersect_ray(Ray(new float[3]{0.0, 0.0, 5.0}, new float[3]{0.0, 0.0, -1.0}));

    return 0;
}