Home
last modified time | relevance | path

Searched refs:n_triangles (Results 1 – 25 of 28) sorted by relevance

12

/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/copyleft/cork/
H A Dmesh_boolean.cpp36 if(A.n_triangles == 0) in mesh_boolean()
39 }else if(B.n_triangles == 0) in mesh_boolean()
48 if(A.n_triangles == 0 || B.n_triangles == 0) in mesh_boolean()
50 ret->n_triangles = 0; in mesh_boolean()
58 if(A.n_triangles == 0) in mesh_boolean()
60 ret->n_triangles = 0; in mesh_boolean()
62 }else if(B.n_triangles == 0) in mesh_boolean()
71 if(A.n_triangles == 0) in mesh_boolean()
74 }else if(B.n_triangles == 0) in mesh_boolean()
H A Dto_cork_mesh.cpp20 mesh.n_triangles = F.rows(); in to_cork_mesh()
23 mesh.triangles = new uint[mesh.n_triangles*3]; in to_cork_mesh()
31 for(size_t f = 0;f<mesh.n_triangles;f++) in to_cork_mesh()
H A Dfrom_cork_mesh.cpp19 F.resize(mesh.n_triangles,3); in from_cork_mesh()
28 for(size_t f = 0;f<mesh.n_triangles;f++) in from_cork_mesh()
/dports/graphics/wings/libigl-2.1.0/include/igl/copyleft/cork/
H A Dmesh_boolean.cpp36 if(A.n_triangles == 0) in mesh_boolean()
39 }else if(B.n_triangles == 0) in mesh_boolean()
48 if(A.n_triangles == 0 || B.n_triangles == 0) in mesh_boolean()
50 ret->n_triangles = 0; in mesh_boolean()
58 if(A.n_triangles == 0) in mesh_boolean()
60 ret->n_triangles = 0; in mesh_boolean()
62 }else if(B.n_triangles == 0) in mesh_boolean()
71 if(A.n_triangles == 0) in mesh_boolean()
74 }else if(B.n_triangles == 0) in mesh_boolean()
H A Dto_cork_mesh.cpp20 mesh.n_triangles = F.rows(); in to_cork_mesh()
23 mesh.triangles = new uint[mesh.n_triangles*3]; in to_cork_mesh()
31 for(size_t f = 0;f<mesh.n_triangles;f++) in to_cork_mesh()
H A Dfrom_cork_mesh.cpp19 F.resize(mesh.n_triangles,3); in from_cork_mesh()
28 for(size_t f = 0;f<mesh.n_triangles;f++) in from_cork_mesh()
/dports/science/code_saturne/code_saturne-7.1.0/src/fvm/
H A Dfvm_nodal_triangulate.c100 cs_lnum_t n_vertices, n_triangles, n_elements; in _triangulate_section() local
182 n_triangles = 0; in _triangulate_section()
216 for (j = 0; j < n_triangles; j++) in _triangulate_section()
221 for (j = 0; j < n_triangles; j++) in _triangulate_section()
226 triangle_id += n_triangles; in _triangulate_section()
234 n_triangles = 1; in _triangulate_section()
251 n_sub_elements[i] = n_triangles; in _triangulate_section()
422 for (j = 0; j < n_triangles; j++) in _triangulate_section_polygons()
427 for (j = 0; j < n_triangles; j++) in _triangulate_section_polygons()
432 element_id[0] += n_triangles; in _triangulate_section_polygons()
[all …]
H A Dfvm_triangulate.c562 const int n_triangles = n_vertices - 2; in _polygon_delaunay_flip() local
612 for (j = 0; j < n_triangles; j++) { in _polygon_delaunay_flip()
1089 int n_triangles = 0; in fvm_triangulate_polygon() local
1167 while ((n_triangles != (n_vertices - 2)) && in fvm_triangulate_polygon()
1170 n_triangles = 0; /* Reset if previous try was a failure */ in fvm_triangulate_polygon()
1207 state->triangle_vertices[n_triangles*3 + 2] = i; in fvm_triangulate_polygon()
1209 n_triangles += 1; in fvm_triangulate_polygon()
1247 if (n_triangles == n_vertices - 2) in fvm_triangulate_polygon()
1258 for (i = 0; i < n_triangles * 3; i++) in fvm_triangulate_polygon()
1262 for (i = 0; i < n_triangles * 3; i++) in fvm_triangulate_polygon()
[all …]
H A Dfvm_tesselation.c944 n_triangles = 0; in _tesselate_polygons()
1019 n_triangles = 1; in _tesselate_polygons()
1025 n_elements_max[0] = n_triangles; in _tesselate_polygons()
1131 n_triangles = 0; in _count_and_index_sub_polygons()
1135 n_triangles += 1; in _count_and_index_sub_polygons()
1145 n_triangles += 1; in _count_and_index_sub_polygons()
1148 if (n_triangles > 0) in _count_and_index_sub_polygons()
1286 n_triangles = 0; in _count_and_index_sub_polyhedra()
1293 n_triangles += 1; in _count_and_index_sub_polyhedra()
1300 if (n_triangles > 0) in _count_and_index_sub_polyhedra()
[all …]
H A Dfvm_point_location.c2431 cs_lnum_t n_triangles; in _polyhedra_section_locate() local
2466 n_triangles = 1; in _polyhedra_section_locate()
2475 for (k = 0; k < n_triangles; k++) { in _polyhedra_section_locate()
2569 int n_triangles; in _polygons_section_locate_3d() local
2650 n_triangles = fvm_triangulate_polygon(3, in _polygons_section_locate_3d()
2664 n_triangles, in _polygons_section_locate_3d()
2724 int n_triangles; in _nodal_section_locate_3d() local
2838 n_triangles = 1; in _nodal_section_locate_3d()
2925 int n_triangles = 0; in _nodal_section_locate_2d() local
3071 n_triangles = 1; in _nodal_section_locate_2d()
[all …]
/dports/science/luscus/luscus_0.8.6/
H A Dsurface.c93 new_child->n_triangles=0; in msrf_New_Surface()
137 if (self->n_triangles==0) { /* the 1st triangle */ in srf_Add_Triangle()
163 self->n_triangles++; in srf_Add_Triangle()
201 for (i=0; i<self->n_triangles; i++) { in msrf_Draw()
311 for (i=0; i<self->n_triangles; i++) { in msrf_Draw1()
452 qsort(self->index,self->n_triangles,sizeof(triangle_t*),compare_triangles); in Sort_by_Depth()
469 for (idx=0; idx<self->n_triangles; idx++) { in Compute_Distances()
494 self->n_triangles=0; in Make_Index()
498 self->n_triangles+=child->n_triangles; in Make_Index()
503 self->index=tptr=(triangle_t**)calloc((unsigned)self->n_triangles,sizeof(triangle_t*)); in Make_Index()
[all …]
H A Dsurface.h38 int n_triangles; member
51 int n_triangles; /* total number of triangles */ member
/dports/science/code_saturne/code_saturne-7.1.0/src/mesh/
H A Dcs_mesh_warping.c387 cs_lnum_t n_triangles, face_shift; in _cut_warped_i_faces_halo() local
478 n_triangles = n_face_vertices - 2; in _cut_warped_i_faces_halo()
479 connect_size += n_triangles*3; in _cut_warped_i_faces_halo()
480 n_new_faces += n_triangles; in _cut_warped_i_faces_halo()
481 n_cut_faces += n_triangles; in _cut_warped_i_faces_halo()
625 n_triangles = n_face_vertices - 2; in _cut_warped_i_faces_halo()
698 cs_lnum_t n_triangles; in _cut_warped_faces() local
744 n_triangles = n_face_vertices - 2; in _cut_warped_faces()
745 connect_size += n_triangles*3; in _cut_warped_faces()
746 n_new_faces += n_triangles; in _cut_warped_faces()
[all …]
/dports/x11/x11perf/x11perf-1.6.1/
H A Ddo_tris.c164 int n_triangles, int shape, int mode) in XPolyTriangle() argument
177 dpy->request += n_triangles; in XPolyTriangle()
181 while (n_triangles) in XPolyTriangle()
183 if ((n_this_time = max_triangles) > n_triangles) in XPolyTriangle()
184 n_this_time = n_triangles; in XPolyTriangle()
185 n_triangles -= n_this_time; in XPolyTriangle()
/dports/science/code_saturne/code_saturne-7.1.0/libple/examples/
H A Dmy_ple_point_location.c1341 int n_triangles = 0; in _triangulate_polygon() local
1428 n_triangles += 1; in _triangulate_polygon()
1467 if (n_triangles == n_vertices - 2) in _triangulate_polygon()
1486 return n_triangles; in _triangulate_polygon()
3592 ple_lnum_t n_triangles; in _polyhedra_section_locate() local
3620 n_triangles = 1; in _polyhedra_section_locate()
3710 int n_triangles; in _polygons_section_locate_3d() local
3848 int n_triangles; in _mesh_section_locate_3d() local
3948 n_triangles = 1; in _mesh_section_locate_3d()
4027 int n_triangles = 0; in _mesh_section_locate_2d() local
[all …]
/dports/science/code_saturne/code_saturne-7.1.0/src/user_examples/
H A Dcs_cad_intersect.cxx342 cs_lnum_t n_triangles = n_f_v - 2; in _build_cell() local
343 if (n_triangles > *n_max_triangles) { in _build_cell()
344 BFT_REALLOC(*triangle_vertices, 3*n_triangles, cs_lnum_t); in _build_cell()
345 *n_max_triangles = n_triangles; in _build_cell()
360 n_triangles = fvm_triangulate_polygon(3, // dimension in _build_cell()
369 assert(n_triangles == n_f_v -2); // unless face is strongly warped. in _build_cell()
375 for (cs_lnum_t ti = 0; ti < n_triangles; ti++) { in _build_cell()
/dports/science/chrono/chrono-7.0.1/src/chrono/fea/
H A DChVisualizationFEAmesh.cpp316 size_t n_triangles = 0; in Update() local
332 n_triangles += 4; // n. triangle faces in Update()
337 n_triangles += 12; // n. triangle faces in Update()
366 … n_triangles += 2 * (sectionshape->GetNofPoints(il) - 1) * (beam_resolution - 1); in Update()
376 … n_triangles += 2 * (shell_resolution - 1) * (shell_resolution - 1); // n. triangle faces in Update()
383 n_triangles += in Update()
426 n_triangles += msurface->GetTriangleList().size(); // n. triangle faces in Update()
439 if (trianglemesh->getIndicesVertexes().size() != n_triangles) in Update()
440 trianglemesh->getIndicesVertexes().resize(n_triangles); in Update()
445 if (trianglemesh->getIndicesNormals().size() != n_triangles) in Update()
[all …]
/dports/graphics/fracplanet/fracplanet-0.5.1/
H A Dtriangle_mesh_viewer_display.cpp379 uint n_triangles=0; in paintGL() local
385 n_triangles+=mesh[m]->triangles(); in paintGL()
391 << n_triangles in paintGL()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/external/openglcts/modules/glesext/tessellation_shader/
H A DesextcTessellationShaderQuads.cpp614 const glw::GLint n_triangles = run.n_vertices / 3 /* vertices per triangle */; in iterate() local
617 triangleMatched.assign(n_triangles, false); in iterate()
619 for (int n_triangle = 0; n_triangle < n_triangles; ++n_triangle) in iterate()
627 for (int n_triangle_b = 0; n_triangle_b < n_triangles; ++n_triangle_b) in iterate()
H A DesextcTessellationShaderTriangles.cpp731 const glw::GLint n_triangles = run.n_vertices / 3 /* vertices per triangle */; in iterate() local
733 for (int n_triangle = 0; n_triangle < n_triangles; ++n_triangle) in iterate()
877 const glw::GLint n_triangles = run.n_vertices / 3 /* vertices per triangle */; in iterate() local
879 for (int n_triangle = 0; n_triangle < n_triangles; ++n_triangle) in iterate()
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_experimental/edit_ocme/src/ocme/
H A Dmain.cpp313 meshona->stat.n_triangles, in PrintStats()
572 meshona->stat.n_triangles += m.fn; in main()
633 meshona->stat.n_triangles += m.fn; in main()
721 printf("tri: %d, ver %d]\n",meshona->stat.n_triangles,meshona->stat.n_vertices); in main()
H A Docme_debug.cpp110 stat.n_triangles += (*ci).second->face->Size(); in ComputeStatistics()
118 stat.n_cells,stat.n_triangles,stat.n_vertices,com,stat.n_proxies in ComputeStatistics()
H A Docme_definition.h63 n_triangles(0), n_vertices(0),n_proxies(0), in Statistics()
68 n_triangles, member
/dports/math/libmesh/libmesh-1.6.2/src/mesh/
H A Dgmsh_io.C1050 unsigned int n_points=0, n_lines=0, n_triangles=0, n_quadrangles=0, in write_post() local
1072 n_triangles += 1; in write_post()
1133 << n_triangles * n_scalar << " " in write_post()
1134 << n_triangles * n_vector << " " in write_post()
1135 << n_triangles * n_tensor << " " in write_post()
/dports/science/axom/axom-0.6.1/src/axom/sidre/tests/
H A Dsidre_mfem_datacollection.cpp618 int n_triangles = 0; member
623 (n_triangles == other.n_triangles) && (n_quads == other.n_quads); in operator ==()
643 result[i - 1].n_triangles = non_const_parmesh.GroupNTriangles(i); in getGroupData()

12