#include <CGAL/AABB_face_graph_triangle_primitive.h>
#include <CGAL/AABB_traits.h>
#include <CGAL/AABB_tree.h>
#include <CGAL/Dual_contouring_3.h>
#include <CGAL/Implicit_domain.h>
#include <CGAL/Side_of_triangle_mesh.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/boost/graph/IO/OFF.h>
#include <iostream>
typedef CGAL::Surface_mesh<Point> Mesh;
typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
typedef CGAL::AABB_traits<Kernel, Primitive> Traits;
typedef CGAL::AABB_tree<Traits> Tree;
typedef std::vector<Point> Point_range;
typedef std::vector<std::vector<std::size_t>> Polygon_range;
int main() {
const std::string input_name = "../../../data/bunny.off";
const Vector grid_spacing(0.005, 0.005, 0.005);
const FT offset_value = 0.01;
Mesh mesh_input;
std::cerr << "Could not read mesh" << std::endl;
exit(-1);
}
CGAL::Bbox_3 aabb_grid = CGAL::Polygon_mesh_processing::bbox(mesh_input);
Vector aabb_increase_vec = Vector(offset_value + 0.01, offset_value + 0.01, offset_value + 0.01);
aabb_grid += (Point(aabb_grid.
xmax(), aabb_grid.
ymax(), aabb_grid.
zmax()) + aabb_increase_vec).bbox();
aabb_grid += (Point(aabb_grid.
xmin(), aabb_grid.
ymin(), aabb_grid.
zmin()) - aabb_increase_vec).bbox();
Tree tree(mesh_input.faces_begin(), mesh_input.faces_end(), mesh_input);
CGAL::Side_of_triangle_mesh<Mesh, CGAL::GetGeomTraits<Mesh>::type> sotm(mesh_input);
auto mesh_distance = [&tree](const Point& p) {
const Point& x = tree.closest_point(p);
};
auto mesh_normal = [&tree](const Point& p) {
const Point& x = tree.closest_point(p);
const Vector n = p - x;
};
aabb_grid, grid_spacing, mesh_distance, mesh_normal);
Point_range points;
Polygon_range polygons;
}