songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

use Mesh_3 for Poisson reconstruction in demo

This commit is contained in:
Jane Tournois 2024-06-04 12:58:45 +02:00
parent b352f28627
commit d2fe7f260f
1 changed files with 36 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

69
Lab/demo/Lab/Plugins/Point_set/Surface_reconstruction_poisson_impl.cpp
View File

@ -7,19 +7,23 @@
#include <CGAL/AABB_tree.h> // must be included before kernel #include <CGAL/AABB_tree.h> // must be included before kernel
#include <CGAL/AABB_traits_3.h> #include <CGAL/AABB_traits_3.h>
#include <CGAL/AABB_face_graph_triangle_primitive.h> #include <CGAL/AABB_face_graph_triangle_primitive.h>
#include <CGAL/Timer.h>
#include <CGAL/Surface_mesh_default_triangulation_3.h>
#include <CGAL/make_surface_mesh.h>
#include <CGAL/Implicit_surface_3.h>
#include <CGAL/IO/facets_in_complex_2_to_triangle_mesh.h>
#include <CGAL/Poisson_reconstruction_function.h> #include <CGAL/Poisson_reconstruction_function.h>
#include <CGAL/compute_average_spacing.h> #include <CGAL/compute_average_spacing.h>
#include <CGAL/Mesh_triangulation_3.h>
#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
#include <CGAL/Mesh_criteria_3.h>
#include <CGAL/Labeled_mesh_domain_3.h>
#include <CGAL/make_mesh_3.h>
#include <CGAL/facets_in_complex_3_to_triangle_mesh.h>
#include <CGAL/Eigen_solver_traits.h> #include <CGAL/Eigen_solver_traits.h>
#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h> #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
#include <math.h> #include <math.h>
#include <CGAL/Timer.h>
#include "Kernel_type.h" #include "Kernel_type.h"
#include "SMesh_type.h" #include "SMesh_type.h"
@ -179,10 +183,11 @@ SMesh* poisson_reconstruct(Point_set& points,
// Poisson implicit function // Poisson implicit function
typedef CGAL::Poisson_reconstruction_function<Kernel> Poisson_reconstruction_function; typedef CGAL::Poisson_reconstruction_function<Kernel> Poisson_reconstruction_function;
// Surface mesher // Mesh_3
typedef CGAL::Surface_mesh_default_triangulation_3 STr; typedef CGAL::Labeled_mesh_domain_3<Kernel> Mesh_domain;
typedef CGAL::Surface_mesh_complex_2_in_triangulation_3<STr> C2t3; typedef typename CGAL::Mesh_triangulation_3<Mesh_domain, CGAL::Default, Concurrency_tag>::type Tr;
typedef CGAL::Implicit_surface_3<Kernel, Poisson_reconstruction_function> Surface_3; typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr> C3t3;
typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
// AABB tree // AABB tree
typedef CGAL::AABB_face_graph_triangle_primitive<SMesh> Primitive; typedef CGAL::AABB_face_graph_triangle_primitive<SMesh> Primitive;
@ -273,7 +278,7 @@ SMesh* poisson_reconstruct(Point_set& points,
else else
{ {
//*************************************** //***************************************
// Surface mesh generation // Surface mesh generation using Mesh_3
//*************************************** //***************************************
std::cerr << "Surface meshing...\n"; std::cerr << "Surface meshing...\n";
@ -301,45 +306,43 @@ SMesh* poisson_reconstruct(Point_set& points,
// conservative bounding sphere centered at inner point. // conservative bounding sphere centered at inner point.
Kernel::FT sm_sphere_radius = 5.0 * radius; Kernel::FT sm_sphere_radius = 5.0 * radius;
Kernel::FT sm_dichotomy_error = sm_distance*average_spacing/1000.0; // Dichotomy error must be << sm_distance Kernel::FT sm_dichotomy_error = sm_distance*average_spacing/1000.0; // Dichotomy error must be << sm_distance
Surface_3 surface(function,
Kernel::Sphere_3(inner_point,sm_sphere_radius*sm_sphere_radius),
sm_dichotomy_error/sm_sphere_radius);
// Defines surface mesh generation criteria // Defines surface mesh generation criteria
CGAL::Surface_mesh_default_criteria_3<STr> criteria(sm_angle, // Min triangle angle (degrees) Mesh_criteria criteria(CGAL::parameters::facet_angle = sm_angle,
sm_radius*average_spacing, // Max triangle size CGAL::parameters::facet_size = sm_radius*average_spacing,
sm_distance*average_spacing); // Approximation error CGAL::parameters::facet_distance = sm_distance*average_spacing);
CGAL_TRACE_STREAM << " make_surface_mesh(sphere center=("<<inner_point << "),\n" CGAL_TRACE_STREAM << " make_mesh_3 with\n"
<< " sphere radius="<<sm_sphere_radius<<",\n" << " \t sphere center = ("<<inner_point << "), \n"
<< " angle="<<sm_angle << " degrees,\n" << " \t sphere radius="<<sm_sphere_radius<<",\n"
<< " triangle size="<<sm_radius<<" * average spacing="<<sm_radius*average_spacing<<",\n" << " \t angle="<<sm_angle << " degrees,\n"
<< " distance="<<sm_distance<<" * average spacing="<<sm_distance*average_spacing<<",\n" << " \t triangle size="<<sm_radius<<" * average spacing="<<sm_radius*average_spacing<<",\n"
<< " dichotomy error=distance/"<<sm_distance*average_spacing/sm_dichotomy_error<<",\n" << " \t distance="<<sm_distance<<" * average spacing="<<sm_distance*average_spacing<<",\n"
<< " Manifold_with_boundary_tag)\n"; << " \t dichotomy error=distance/"<<sm_distance*average_spacing/sm_dichotomy_error<<",\n"
<< " \t Manifold_with_boundary_tag\n";
// Generates surface mesh with manifold option Mesh_domain domain = Mesh_domain::create_implicit_mesh_domain(function, bsphere,
STr tr; // 3D Delaunay triangulation for surface mesh generation CGAL::parameters::relative_error_bound(sm_dichotomy_error / sm_sphere_radius));
C2t3 c2t3(tr); // 2D complex in 3D Delaunay triangulation
CGAL::make_surface_mesh(c2t3, // reconstructed mesh // Generates mesh with manifold option
surface, // implicit surface C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
criteria, // meshing criteria CGAL::parameters::no_exude().no_perturb()
CGAL::Manifold_with_boundary_tag()); // require manifold mesh .manifold_with_boundary());
// Prints status // Prints status
std::cerr << "Surface meshing: " << task_timer.time() << " seconds, " std::cerr << "Surface meshing: " << task_timer.time() << " seconds, "
<< tr.number_of_vertices() << " output vertices" << c3t3.triangulation().number_of_vertices() << " output vertices"
<< std::endl; << std::endl;
task_timer.reset(); task_timer.reset();
if(tr.number_of_vertices() == 0) if(c3t3.triangulation().number_of_vertices() == 0)
{ {
delete mesh; delete mesh;
return nullptr; return nullptr;
} }
// Converts to polyhedron // Converts to polyhedron
CGAL::facets_in_complex_2_to_triangle_mesh(c2t3, *mesh); CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, *mesh);
// Prints total reconstruction duration // Prints total reconstruction duration
std::cerr << "Total reconstruction (implicit function + meshing): " << reconstruction_timer.time() << " seconds\n"; std::cerr << "Total reconstruction (implicit function + meshing): " << reconstruction_timer.time() << " seconds\n";