mirror of https://github.com/CGAL/cgal
Merge pull request #3777 from lrineau/Mesh_3-add_example_Surface_mesh-GF
Add two examples with Surface_mesh instead of Polyhedron
This commit is contained in:
commit
2835fff295
|
|
@ -81,7 +81,9 @@ if ( CGAL_FOUND )
|
||||||
create_single_source_cgal_program( "mesh_polyhedral_domain_sm.cpp" )
|
create_single_source_cgal_program( "mesh_polyhedral_domain_sm.cpp" )
|
||||||
create_single_source_cgal_program( "mesh_polyhedral_domain_with_surface_inside.cpp" )
|
create_single_source_cgal_program( "mesh_polyhedral_domain_with_surface_inside.cpp" )
|
||||||
create_single_source_cgal_program( "remesh_polyhedral_surface.cpp" )
|
create_single_source_cgal_program( "remesh_polyhedral_surface.cpp" )
|
||||||
|
create_single_source_cgal_program( "remesh_polyhedral_surface_sm.cpp" )
|
||||||
create_single_source_cgal_program( "mesh_polyhedral_domain_with_features.cpp" )
|
create_single_source_cgal_program( "mesh_polyhedral_domain_with_features.cpp" )
|
||||||
|
create_single_source_cgal_program( "mesh_polyhedral_domain_with_features_sm.cpp" )
|
||||||
create_single_source_cgal_program( "mesh_polyhedral_domain_with_lipschitz_sizing.cpp" )
|
create_single_source_cgal_program( "mesh_polyhedral_domain_with_lipschitz_sizing.cpp" )
|
||||||
create_single_source_cgal_program( "mesh_polyhedral_complex.cpp" )
|
create_single_source_cgal_program( "mesh_polyhedral_complex.cpp" )
|
||||||
create_single_source_cgal_program( "mesh_polyhedral_complex_sm.cpp" )
|
create_single_source_cgal_program( "mesh_polyhedral_complex_sm.cpp" )
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,70 @@
|
||||||
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
|
|
||||||
|
#include <CGAL/Mesh_triangulation_3.h>
|
||||||
|
#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
|
||||||
|
#include <CGAL/Mesh_criteria_3.h>
|
||||||
|
|
||||||
|
#include <CGAL/Surface_mesh.h>
|
||||||
|
#include <CGAL/Polyhedral_mesh_domain_with_features_3.h>
|
||||||
|
#include <CGAL/make_mesh_3.h>
|
||||||
|
|
||||||
|
// Domain
|
||||||
|
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
|
||||||
|
typedef CGAL::Surface_mesh<K::Point_3> Polyhedron;
|
||||||
|
typedef CGAL::Polyhedral_mesh_domain_with_features_3<K, Polyhedron> Mesh_domain;
|
||||||
|
|
||||||
|
|
||||||
|
#ifdef CGAL_CONCURRENT_MESH_3
|
||||||
|
typedef CGAL::Parallel_tag Concurrency_tag;
|
||||||
|
#else
|
||||||
|
typedef CGAL::Sequential_tag Concurrency_tag;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Triangulation
|
||||||
|
typedef CGAL::Mesh_triangulation_3<Mesh_domain,CGAL::Default,Concurrency_tag>::type Tr;
|
||||||
|
|
||||||
|
typedef CGAL::Mesh_complex_3_in_triangulation_3<
|
||||||
|
Tr,Mesh_domain::Corner_index,Mesh_domain::Curve_index> C3t3;
|
||||||
|
|
||||||
|
// Criteria
|
||||||
|
typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
|
||||||
|
|
||||||
|
// To avoid verbose function and named parameters call
|
||||||
|
using namespace CGAL::parameters;
|
||||||
|
|
||||||
|
int main(int argc, char*argv[])
|
||||||
|
{
|
||||||
|
const char* fname = (argc>1)?argv[1]:"data/fandisk.off";
|
||||||
|
std::ifstream input(fname);
|
||||||
|
Polyhedron polyhedron;
|
||||||
|
input >> polyhedron;
|
||||||
|
if(input.fail()){
|
||||||
|
std::cerr << "Error: Cannot read file " << fname << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!CGAL::is_triangle_mesh(polyhedron)){
|
||||||
|
std::cerr << "Input geometry is not triangulated." << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Create domain
|
||||||
|
Mesh_domain domain(polyhedron);
|
||||||
|
|
||||||
|
// Get sharp features
|
||||||
|
domain.detect_features();
|
||||||
|
|
||||||
|
// Mesh criteria
|
||||||
|
Mesh_criteria criteria(edge_size = 0.025,
|
||||||
|
facet_angle = 25, facet_size = 0.05, facet_distance = 0.005,
|
||||||
|
cell_radius_edge_ratio = 3, cell_size = 0.05);
|
||||||
|
|
||||||
|
// Mesh generation
|
||||||
|
C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);
|
||||||
|
|
||||||
|
// Output
|
||||||
|
std::ofstream medit_file("out.mesh");
|
||||||
|
c3t3.output_to_medit(medit_file);
|
||||||
|
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,65 @@
|
||||||
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
|
|
||||||
|
#include <CGAL/Mesh_triangulation_3.h>
|
||||||
|
#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
|
||||||
|
#include <CGAL/Mesh_criteria_3.h>
|
||||||
|
|
||||||
|
#include <CGAL/Surface_mesh.h>
|
||||||
|
#include <CGAL/Polyhedral_mesh_domain_with_features_3.h>
|
||||||
|
#include <CGAL/make_mesh_3.h>
|
||||||
|
|
||||||
|
// Domain
|
||||||
|
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
|
||||||
|
typedef CGAL::Surface_mesh<K::Point_3> Polyhedron;
|
||||||
|
typedef CGAL::Polyhedral_mesh_domain_with_features_3<K, Polyhedron> Mesh_domain;
|
||||||
|
|
||||||
|
// Triangulation
|
||||||
|
typedef CGAL::Mesh_triangulation_3<Mesh_domain>::type Tr;
|
||||||
|
typedef CGAL::Mesh_complex_3_in_triangulation_3<
|
||||||
|
Tr,Mesh_domain::Corner_index,Mesh_domain::Curve_index> C3t3;
|
||||||
|
|
||||||
|
// Criteria
|
||||||
|
typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
|
||||||
|
|
||||||
|
// To avoid verbose function and named parameters call
|
||||||
|
using namespace CGAL::parameters;
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
// Load a polyhedron
|
||||||
|
Polyhedron poly;
|
||||||
|
std::ifstream input("data/lion-head.off");
|
||||||
|
input >> poly;
|
||||||
|
|
||||||
|
if (!CGAL::is_triangle_mesh(poly)){
|
||||||
|
std::cerr << "Input geometry is not triangulated." << std::endl;
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Create a vector with only one element: the pointer to the polyhedron.
|
||||||
|
std::vector<Polyhedron*> poly_ptrs_vector(1, &poly);
|
||||||
|
|
||||||
|
// Create a polyhedral domain, with only one polyhedron,
|
||||||
|
// and no "bounding polyhedron", so the volumetric part of the domain will be
|
||||||
|
// empty.
|
||||||
|
Mesh_domain domain(poly_ptrs_vector.begin(), poly_ptrs_vector.end());
|
||||||
|
|
||||||
|
// Get sharp features
|
||||||
|
domain.detect_features(); //includes detection of borders
|
||||||
|
|
||||||
|
// Mesh criteria
|
||||||
|
Mesh_criteria criteria(edge_size = 0.025,
|
||||||
|
facet_angle = 25,
|
||||||
|
facet_size = 0.1,
|
||||||
|
facet_distance = 0.001);
|
||||||
|
|
||||||
|
// Mesh generation
|
||||||
|
C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria, no_perturb(), no_exude());
|
||||||
|
|
||||||
|
// Output the facets of the c3t3 to an OFF file. The facets will not be
|
||||||
|
// oriented.
|
||||||
|
std::ofstream off_file("out.off");
|
||||||
|
c3t3.output_boundary_to_off(off_file);
|
||||||
|
|
||||||
|
return off_file.fail() ? EXIT_FAILURE : EXIT_SUCCESS;
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue