#include <iostream>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Octree.h>
using Point_vector = std::vector<Point>;
int main() {
Point_vector points;
points.emplace_back(1, 1, 1);
points.emplace_back(2, 1, -11);
points.emplace_back(2, 1, 1);
points.emplace_back(1, -2, 1);
points.emplace_back(1, 1, 1);
points.emplace_back(-1, 1, 1);
Octree octree(points);
octree.refine(10, 1);
std::cout << octree;
return EXIT_SUCCESS;
}
A data structure using an axis-aligned hyperrectangle decomposition of dD space for efficient access ...
Definition: Orthtree.h:117