Home
last modified time | relevance | path

Searched refs:c3t3 (Results 1 – 25 of 103) sorted by relevance

12345

/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Drefine_periodic_3_mesh_3.h71 typename C3T3::Index index = c3t3.index(v); in find_points_to_project()
82 void project_points(C3T3& c3t3, in project_points() argument
130 c3t3.set_dimension(new_vertex, 2); in project_points()
200 void refine_periodic_3_mesh_3_impl(C3T3& c3t3,
227 c3t3.swap(tmp_c3t3);
233 Mesher mesher(c3t3, domain, criteria,
239 c3t3.clear_manifold_info();
256 odt_optimize_mesh_3(c3t3, domain,
266 lloyd_optimize_mesh_3(c3t3, domain,
286 perturb_mesh_3(c3t3, domain,
[all …]
H A Dmake_periodic_3_mesh_3.h40 void mark_dummy_points(C3T3& c3t3) in mark_dummy_points() argument
49 c3t3.set_index(vit, 0); in mark_dummy_points()
54 void init_c3t3_with_features(C3T3& c3t3,
83 void operator()(C3T3& c3t3, in operator()
90 c3t3.triangulation().insert_dummy_points(); in operator()
91 mark_dummy_points(c3t3); in operator()
147 initialize_features(C3T3& c3t3,
176 C3T3 c3t3;
177 make_periodic_3_mesh_3_bp(c3t3,md,mc,t...);
178 return c3t3;
[all …]
H A Dmake_mesh_3.h168 c3t3.set_index(v,it->second);
205 protect_edges(c3t3,
234 initialize_features(C3T3& c3t3,
240 (c3t3, domain, criteria,
265 void operator()(C3T3& c3t3,
288 void operator()(C3T3& c3t3,
309 void operator()(C3T3& c3t3,
347 void operator()(C3T3& c3t3,
377 C3T3 c3t3;
379 return c3t3;
[all …]
H A Doptimize_periodic_3_mesh_3.h43 (required (in_out(c3t3),*) (domain,*))
47 … (sliver_criterion_, *, parameters::default_values::default_sliver_criterion(c3t3, sliver_bound_))
48 (perturbation_vector_, *, default_perturbation_vector(c3t3,domain,sliver_criterion_))
53 return perturb_mesh_3_impl(c3t3, domain, time_limit_, sliver_criterion_,
63 (required (in_out(c3t3),*))
70 return exude_mesh_3_impl(c3t3, time_limit_, sliver_bound_);
80 (required (in_out(c3t3),*) (domain,*))
90 return odt_optimize_mesh_3_impl(c3t3, domain,
102 (required (in_out(c3t3),*) (domain,*))
112 return lloyd_optimize_mesh_3_impl(c3t3, domain,
H A Dfacets_in_complex_3_to_triangle_mesh.h52 void facets_in_complex_3_to_triangle_soup(const C3T3& c3t3,
75 size_type nf = c3t3.number_of_facets_in_complex();
82 for(Ficit fit = c3t3.facets_in_complex_begin(),
83 end = c3t3.facets_in_complex_end(); fit != end; ++fit)
90 typename C3T3::Subdomain_index cell_sdi = c3t3.subdomain_index(c);
91 typename C3T3::Subdomain_index opp_sdi = c3t3.subdomain_index(c->neighbor(s));
106 const Weighted_point& p = c3t3.triangulation().point(c, (s+i)&3);
133 void facets_in_complex_3_to_triangle_soup(const C3T3& c3t3, in facets_in_complex_3_to_triangle_soup() argument
139 facets_in_complex_3_to_triangle_soup(c3t3, useless, points, faces, in facets_in_complex_3_to_triangle_soup()
162 void facets_in_complex_3_to_triangle_mesh(const C3T3& c3t3, TriangleMesh& graph) in facets_in_complex_3_to_triangle_mesh() argument
[all …]
H A Dremove_far_points_in_mesh_3.h40 Remove_far_points(C3T3 &c3t3) : m_c3t3(c3t3) {} in Remove_far_points() argument
60 Remove_far_points(C3T3 &c3t3) : m_c3t3(c3t3) {} in Remove_far_points() argument
76 remove_far_points_in_mesh_3(C3T3& c3t3) in remove_far_points_in_mesh_3() argument
79 Remove_far_points cu(c3t3); in remove_far_points_in_mesh_3()
H A Drefine_mesh_3.h60 Insert_vertex_in_c3t3(C3T3& c3t3) in Insert_vertex_in_c3t3() argument
61 : r_c3t3_(c3t3) {} in Insert_vertex_in_c3t3()
485 return refine_mesh_3_impl(c3t3,
521 void refine_mesh_3_impl(C3T3& c3t3,
547 c3t3.swap(tmp_c3t3);
550 dump_c3t3(c3t3, mesh_options.dump_after_init_prefix);
561 c3t3.clear_manifold_info();
568 odt_optimize_mesh_3(c3t3,
579 lloyd_optimize_mesh_3(c3t3,
599 perturb_mesh_3(c3t3,
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_3/
H A DLloyd_move.h76 const C3T3& c3t3, in operator()
85 switch ( c3t3.in_dimension(v) ) in operator()
123 : plane_(plane), c3t3_(c3t3) in Project_on_plane()
216 const C3T3& c3t3, in lloyd_move_on_boundary() argument
219 CGAL_precondition(c3t3.in_dimension(v) == 2); in lloyd_move_on_boundary()
262 const Tr& tr = c3t3.triangulation(); in extract_lloyd_boundary_points()
281 if ( ! c3t3.is_in_complex(*fit) ) in extract_lloyd_boundary_points()
306 const C3T3& c3t3, in centroid_segment_move() argument
534 const C3T3& c3t3, in turn_around_edge() argument
539 CGAL_precondition(c3t3.in_dimension(v) == 3); in turn_around_edge()
[all …]
H A Dvertex_perturbation.h233 C3T3& c3t3, in operator()
310 C3T3& c3t3,
421 C3T3& c3t3,
440 C3T3& c3t3,
476 if ( c3t3.in_dimension(v) < 3 )
585 C3T3& c3t3,
761 C3T3& c3t3,
912 C3T3& c3t3,
1142 C3T3& c3t3,
1282 C3T3& c3t3,
[all …]
H A DDump_c3t3.h43 void dump_c3t3(const C3t3& c3t3, std::string prefix) const in dump_c3t3()
48 CGAL::IO::output_to_medit(medit_file, c3t3, false /*rebind*/, true /*show_patches*/); in dump_c3t3()
59 bin_file << c3t3; in dump_c3t3()
105 void dump_c3t3_edges(const C3t3& c3t3, std::string prefix)
108 c3t3.triangulation().geom_traits().construct_point_3_object();
113 edge_it = c3t3.edges_in_complex_begin(),
114 end = c3t3.edges_in_complex_end();
120 const typename C3t3::Triangulation::Weighted_point& ei = c3t3.triangulation().point(c, i);
121 const typename C3t3::Triangulation::Weighted_point& ej = c3t3.triangulation().point(c, j);
126 void dump_c3t3(const C3t3& c3t3, std::string prefix)
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Tetrahedral_remeshing/internal/
H A Dcollapse_short_edges.h546 if (c3t3.in_dimension(v0) != 2 || c3t3.in_dimension(v1) != 2) in collapse_preserves_surface_star()
593 || c3t3.subdomain_index(mf.first) < c3t3.subdomain_index(f.first)) in collapse_preserves_surface_star()
739 CGAL_assertion(c3t3.surface_patch_index(f1) == c3t3.surface_patch_index(f2)); in merge_surface_patch_indices()
742 c3t3.remove_from_complex(f2); in merge_surface_patch_indices()
751 C3t3& c3t3) in collapse() argument
759 Tr& tr = c3t3.triangulation(); in collapse()
870 c3t3.add_to_complex(eiv0, vkept, c3t3.curve_index(eiv0, eiv1)); in collapse()
879 c3t3.add_to_complex(vkept, eiv1, c3t3.curve_index(eiv0, eiv1)); in collapse()
1033 C3t3& c3t3, in collapse_edge() argument
1157 if (c3t3.is_in_complex(e)) in can_be_collapsed()
[all …]
H A Dtetrahedral_remeshing_helpers.h318 bool is_peelable(const C3t3& c3t3, in is_peelable() argument
325 if(!c3t3.is_in_complex(ch)) in is_peelable()
442 return c3t3.is_in_complex(f) in is_boundary()
497 if (c3t3.is_in_complex(f)) in is_boundary_vertex()
507 const C3t3& c3t3) in surface_patch_index() argument
516 if (c3t3.is_in_complex(f)) in surface_patch_index()
605 if(c3t3.is_in_complex(f)) in incident_surface_patches()
660 if (c3t3.is_in_complex(e)) in nb_incident_complex_edges()
818 if (c3t3.is_in_complex( in is_internal()
964 incident_subdomains(v0, c3t3, in compare_subdomains()
[all …]
H A Dsplit_long_edges.h48 Tr& tr = c3t3.triangulation(); in split_edge()
57 if(c3t3.is_in_complex(e)) in split_edge()
122 if (c3t3.is_in_complex(c)) in split_edge()
123 c3t3.remove_from_complex(c); in split_edge()
134 if(c3t3.is_in_complex(c, findex)) in split_edge()
172 c3t3.add_to_complex(new_cell, in split_edge()
191 set_index(new_v, c3t3); in split_edge()
198 const C3T3& c3t3, in can_be_split() argument
207 if (c3t3.is_in_complex(e)) in can_be_split()
232 void split_long_edges(C3T3& c3t3, in split_long_edges() argument
[all …]
H A Dsmooth_vertices.h58 void init(const C3t3& c3t3, in init() argument
76 c3t3); in init()
102 if (c3t3.is_in_complex(edge)) in find_adjacent_facet_on_surface()
152 const Tr& tr = c3t3.triangulation(); in compute_vertices_normals()
176 || c3t3.subdomain_index(mf.first) < c3t3.subdomain_index(f.first)) in compute_vertices_normals()
378 const C3t3& c3t3, in collect_vertices_surface_indices() argument
401 void smooth_vertices(C3T3& c3t3, in smooth_vertices() argument
423 Tr& tr = c3t3.triangulation(); in smooth_vertices()
471 if (c3t3.is_in_complex(e)) in smooth_vertices()
482 if (!c3t3.is_in_complex(vh0)) in smooth_vertices()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/IO/
H A DFile_tetgen.h33 const C3T3& c3t3) in output_to_tetgen() argument
45 Cell_pmap cell_pmap(c3t3); in output_to_tetgen()
46 Facet_pmap facet_pmap(c3t3,cell_pmap); in output_to_tetgen()
51 c3t3, in output_to_tetgen()
72 const C3T3& c3t3,
91 const Tr& tr = c3t3.triangulation();
140 cit = c3t3.cells_in_complex_begin(),
141 end = c3t3.cells_in_complex_end();
169 fit = c3t3.facets_in_complex_begin(),
170 end = c3t3.facets_in_complex_end();
[all …]
H A Doutput_to_vtu.h37 const C3T3 & c3t3, in write_cells_tag() argument
66 cit != c3t3.cells_in_complex_end() ; in write_cells_tag()
88 cit != c3t3.cells_in_complex_end() ; in write_cells_tag()
109 cit != c3t3.cells_in_complex_end() ; in write_cells_tag()
121 const C3T3 & c3t3, in write_cells() argument
130 cit != c3t3.cells_in_complex_end() ; in write_cells()
280 const C3T3& c3t3,
287 const Tr& tr = c3t3.triangulation();
335 write_cells(os,c3t3,V);
357 const C3T3& c3t3,
[all …]
H A DFile_medit.h66 : r_c3t3_(c3t3) in Rebind_cell_pmap()
164 : r_c3t3_(c3t3) {} in No_rebind_cell_pmap()
214 : r_c3t3_(c3t3) in Rebind_facet_pmap()
339 : r_c3t3_(c3t3) {} in No_rebind_facet_pmap()
372 : r_c3t3_(c3t3) {} in No_rebind_facet_pmap_first()
406 : r_c3t3_(c3t3) {} in No_rebind_facet_pmap_second()
535 , r_c3t3_(c3t3) in Default_vertex_pmap()
718 Cell_pmap cell_pmap(c3t3);
724 c3t3,
905 c3t3.triangulation() = t3;
[all …]
H A DComplex_3_in_triangulation_3_to_vtk.h34 output_c3t3_to_vtk_unstructured_grid(const C3T3& c3t3,
42 const Triangulation& tr = c3t3.triangulation();
48 vtk_points->Allocate(c3t3.triangulation().number_of_vertices()- c3t3.number_of_far_points());
49 vtk_facets->Allocate(c3t3.number_of_facets_in_complex());
50 …vtk_cells->Allocate(export_complex ? c3t3.number_of_cells_in_complex() : tr.number_of_finite_cells…
72 fit = c3t3.facets_in_complex_begin(),
73 end = c3t3.facets_in_complex_end();
87 cit = c3t3.cells_in_complex_begin(),
88 end = c3t3.cells_in_complex_end();
103 if(!c3t3.is_in_complex(cit))
H A DFile_maya.h32 const C3T3& c3t3,
49 const Tr& tr = c3t3.triangulation();
106 if ( (surfaceOnly && c3t3.in_dimension(vit) <= 2)
137 typename C3T3::size_type number_of_triangles = c3t3.number_of_facets_in_complex();
154 for( Facet_iterator fit = c3t3.facets_in_complex_begin();
155 fit != c3t3.facets_in_complex_end();
170 (fit->second % 2 == 0 && !c3t3.is_in_complex(fit->first))
171 || (fit->second % 2 != 0 && c3t3.is_in_complex(fit->first));
208 facets_sstr << " setAttr -s " << 4*c3t3.number_of_cells_in_complex()
211 for( Cell_iterator cit = c3t3.cells_in_complex_begin();
[all …]
H A DFile_avizo.h38 const C3T3& c3t3) in output_to_avizo() argument
48 const Tr& tr = c3t3.triangulation(); in output_to_avizo()
59 os << "nTetrahedra " << c3t3.number_of_cells_in_complex() << std::endl; in output_to_avizo()
123 cit = c3t3.cells_in_complex_begin(), in output_to_avizo()
124 end = c3t3.cells_in_complex_end(); in output_to_avizo()
136 cit = c3t3.cells_in_complex_begin(), in output_to_avizo()
137 end = c3t3.cells_in_complex_end(); in output_to_avizo()
/dports/math/cgal/CGAL-5.3/demo/Polyhedron/Plugins/Mesh_3/
H A DC3t3_rib_exporter_plugin.cpp100 void init_point_radius(const C3t3& c3t3);
104 void fill_points_and_edges_map(const C3t3& c3t3);
225 init_point_radius(c3t3_item->c3t3()); in create_rib()
415 fill_points_and_edges_map(c3t3_item.c3t3()); in save()
476 init_point_radius(const C3t3& c3t3) in init_point_radius() argument
478 const CGAL::Bbox_3 bbox = c3t3.bbox(); in init_point_radius()
525 fill_points_and_edges_map(const C3t3& c3t3) in fill_points_and_edges_map() argument
689 QColor color = c3t3.is_in_complex(c) ? subdomain_map_[c3t3.subdomain_index(c)] in write_facets()
723 QColor color = c3t3.is_in_complex(c) ? subdomain_map_[c3t3.subdomain_index(c)] in write_facets()
749 if (c3t3.in_dimension(c->vertex(i)) == 2) in write_surface_cells()
[all …]
H A DOptimization_plugin_cgal_code.cpp47 Optimization_function_base(C3t3& c3t3, Domain* d) in Optimization_function_base() argument
48 : c3t3_(c3t3), domain_(d) {} in Optimization_function_base()
240 : Base(c3t3,d) in Global_optimization_function()
322 : Base(c3t3,d) in Optimization_function()
340 operator()(C3t3& c3t3, const Domain& domain) in operator ()() argument
436 : Base(c3t3,d) in Optimization_function()
454 operator()(C3t3& c3t3, const Domain& domain) in operator ()() argument
564 : Base(c3t3,d) in Optimization_function()
704 : Base(c3t3,d) in Optimization_function()
730 operator()(C3t3& c3t3, const Domain&) in operator ()() argument
[all …]
H A DC3t3_io_plugin.cpp38 bool try_load_a_cdt_3(std::istream& in, C3t3& c3t3);
98 item->c3t3().clear(); in load()
109 item->c3t3().clear(); in load()
111 if(try_load_a_cdt_3(in, item->c3t3())) { in load()
132 item->c3t3().rescan_after_load_of_triangulation(); in load()
243 c3t3_item->c3t3().output_to_maya( in save()
489 try_load_a_cdt_3(std::istream& is, C3t3& c3t3) in try_load_a_cdt_3() argument
514 if(c3t3.triangulation().file_input< in try_load_a_cdt_3()
519 c3t3.rescan_after_load_of_triangulation(); in try_load_a_cdt_3()
557 std::istream& f_is = c3t3.triangulation().file_input< in try_load_other_binary_format()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Periodic_3_mesh_3/IO/
H A DFile_medit.h86 const C3T3& c3t3,
121 const Triangulation& tr = c3t3.triangulation();
209 for(Facet_iterator fit = c3t3.facets_begin(); fit != c3t3.facets_end(); ++fit)
272 for(Cell_iterator cit = c3t3.cells_begin(); cit !=c3t3.cells_end(); ++cit)
302 const C3T3& c3t3, in output_to_medit() argument
309 CGAL_precondition(c3t3.triangulation().is_1_cover()); in output_to_medit()
317 Cell_pmap cell_pmap(c3t3); in output_to_medit()
318 Facet_pmap facet_pmap(c3t3, cell_pmap); in output_to_medit()
319 Facet_pmap_twice facet_pmap_twice(c3t3, cell_pmap); in output_to_medit()
320 Vertex_pmap vertex_pmap(c3t3, cell_pmap, facet_pmap); in output_to_medit()
[all …]
/dports/math/cgal/CGAL-5.3/demo/Polyhedron/
H A DScene_c3t3_item.h38 Scene_c3t3_item(const C3t3& c3t3, bool is_surface = false);
50 return CGAL::IO::save_binary_file(os, c3t3()); in save_binary()
56 return !!(os << c3t3()); in save_ascii()
67 const C3t3& c3t3() const;
68 C3t3& c3t3();
92 return c3t3().triangulation().number_of_vertices() == 0 in isEmpty()
93 || ( c3t3().number_of_vertices_in_complex() == 0 in isEmpty()
94 && c3t3().number_of_facets_in_complex() == 0 in isEmpty()
95 && c3t3().number_of_cells_in_complex() == 0 ); in isEmpty()

12345