#include #include #include #include #include #include #include // Domain typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef CGAL::Mesh_polyhedron_3::type Polyhedron; typedef CGAL::Polyhedral_complex_mesh_domain_3 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::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 Mesh_criteria; // To avoid verbose function and named parameters call using namespace CGAL::parameters; const char* const filenames[] = { "data/patches/patch-01.off", "data/patches/patch-13.off", "data/patches/patch-20.off", "data/patches/patch-21.off", "data/patches/patch-23.off", "data/patches/patch-30.off", }; const std::pair incident_subdomains[] = { std::make_pair(0, 1), std::make_pair(1, 3), std::make_pair(2, 0), std::make_pair(2, 1), std::make_pair(2, 3), std::make_pair(3, 0), }; int main() { const std::size_t nb_patches = sizeof(filenames) / sizeof(const char*); CGAL_assertion(sizeof(incident_subdomains) == nb_patches * sizeof(std::pair)); std::vector patches(nb_patches); for(std::size_t i = 0; i < nb_patches; ++i) { std::ifstream input(filenames[i]); if(!(input >> patches[i])) { std::cerr << "Error reading " << filenames[i] << " as a polyhedron!\n"; return EXIT_FAILURE; } } // Create domain Mesh_domain domain(patches.begin(), patches.end(), incident_subdomains, incident_subdomains+nb_patches); domain.detect_features(); //includes detection of borders // Mesh criteria Mesh_criteria criteria(edge_size = 8, facet_angle = 25, facet_size = 8, facet_distance = 0.2, cell_radius_edge_ratio = 3, cell_size = 10); // Mesh generation C3t3 c3t3 = CGAL::make_mesh_3(domain, criteria); // Output std::ofstream medit_file("out.mesh"); c3t3.output_to_medit(medit_file); return EXIT_SUCCESS; }