mirror of https://github.com/CGAL/cgal
42 lines
1.1 KiB
C++
42 lines
1.1 KiB
C++
#include <fstream>
|
|
#include <iostream>
|
|
|
|
#include <CGAL/Simple_cartesian.h>
|
|
#include <CGAL/Octree.h>
|
|
#include <CGAL/Point_set_3.h>
|
|
#include <CGAL/Point_set_3/IO.h>
|
|
|
|
// Type Declarations
|
|
using Kernel = CGAL::Simple_cartesian<double>;
|
|
using Point = Kernel::Point_3;
|
|
using Point_set = CGAL::Point_set_3<Point>;
|
|
using Point_map = Point_set::Point_map;
|
|
using Octree = CGAL::Octree<Kernel, Point_set, Point_map>;
|
|
|
|
int main(int argc, char **argv) {
|
|
|
|
// Point set will be used to hold our points
|
|
Point_set points;
|
|
|
|
// Load points from a file.
|
|
std::ifstream stream((argc > 1) ? argv[1] : CGAL::data_file_path("points_3/cube.pwn"));
|
|
stream >> points;
|
|
if (0 == points.number_of_points()) {
|
|
|
|
std::cerr << "Error: cannot read file" << std::endl;
|
|
return EXIT_FAILURE;
|
|
}
|
|
std::cout << "loaded " << points.number_of_points() << " points\n" << std::endl;
|
|
|
|
// Create an octree from the points
|
|
Octree octree(points, points.point_map());
|
|
|
|
// Build the octree with a small bucket size, using a more verbose method
|
|
octree.refine(CGAL::Orthtrees::Maximum_contained_elements(10));
|
|
|
|
// Print out the tree
|
|
std::cout << octree << std::endl;
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|