Home
last modified time | relevance | path

Searched refs:n_vertices (Results 1 – 25 of 1082) sorted by relevance

12345678910>>...44

/dports/math/polymake/polymake-4.5/apps/polytope/src/
H A Dprism.cc34 if (n_vertices==0) { in prism_coord()
35 n_vertices=V.rows(); in prism_coord()
36 n_vertices_out=2*n_vertices-rays.size(); in prism_coord()
53 Int n_vertices = 0, n_vertices_out = 0; in prism() local
63 n_vertices = VIF.cols(); in prism()
74 … / sequence(n_vertices,n_vertices) ) // top facet = cloned polytope in prism()
77 / (rays + sequence(n_vertices,n_vertices-rays.size())) ); in prism()
105 (*i)[j] += n_vertices; in prism()
108 Array<Int> swap(sequence(n_vertices, n_vertices)); in prism()
109 swap.append(n_vertices,entire(sequence(0,n_vertices))); in prism()
[all …]
H A Dwedge.cc63 n_vertices = VIF.cols(), in wedge_coord() local
65 n_vertices_out = 2*n_vertices-n_vertices_edge; in wedge_coord()
82 lift_to_hyperplane(select(rows(V_out), range(n_vertices, n_vertices_out-1)), *rit); in wedge_coord()
85 V_out.col(d).slice(sequence(0, n_vertices)-VIF[wedge_facet]) = in wedge_coord()
86 z/z_prime * V_out.col(d).slice(range(n_vertices,n_vertices_out-1)); in wedge_coord()
104 n_vertices = VIF.cols(), in wedge() local
112 n_vertices_out = 2*n_vertices - n_vertices_edge; in wedge()
116 / range(0,n_vertices-1); // bottom facet = original polytope in wedge()
119 VIF_out[wedge_facet]+=range(n_vertices,n_vertices_out-1); in wedge()
136 common::read_labels(p_in, "VERTEX_LABELS", select(labels, sequence(0, n_vertices))); in wedge()
[all …]
H A Ddim_from_incidence.cc27 ridges_of_first(Int n_vertices, Iterator set) in dgraph()
29 FacetList R(n_vertices); in dgraph()
41 const Int n_vertices = VIF.cols();
42 if (n_vertices <= 3)
43 return n_vertices-1; // return COMBINATORIAL_DIM !
45 FacetList F=ridges_of_first(n_vertices, entire(rows(VIF)));
50 F=ridges_of_first(n_vertices, entire(F));
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DArr_vertex_index_map.h71 n_vertices (0), in Arr_vertex_index_map()
156 n_vertices = 0; in after_detach()
167 n_vertices++; in after_create_vertex()
174 index_map[v] = n_vertices - 1; in after_create_vertex()
175 rev_map[n_vertices - 1] = v; in after_create_vertex()
185 n_vertices++; in after_create_boundary_vertex()
192 index_map[v] = n_vertices - 1; in after_create_boundary_vertex()
193 rev_map[n_vertices - 1] = v; in after_create_boundary_vertex()
203 n_vertices--; in before_remove_vertex()
217 if (index == n_vertices) in before_remove_vertex()
[all …]
/dports/graphics/opendx/dx-4.4.4/src/exec/dxmods/
H A D_connectvor.c605 trianglelist[numtri]=DXTri(i, n_vertices.r, n_vertices.p); in ConnectVoronoiField()
636 trianglelist[numtri]=DXTri(i, n_vertices.q, n_vertices.p); in ConnectVoronoiField()
667 trianglelist[numtri]=DXTri(i, n_vertices.q, n_vertices.r); in ConnectVoronoiField()
695 trianglelist[numtri]=DXTri(i, n_vertices.p, n_vertices.r); in ConnectVoronoiField()
723 trianglelist[numtri]=DXTri(i, n_vertices.p, n_vertices.q); in ConnectVoronoiField()
751 trianglelist[numtri]=DXTri(i, n_vertices.r, n_vertices.q); in ConnectVoronoiField()
838 trianglelist[numtri]=DXTri(i, n_vertices.p, n_vertices.q); in ConnectVoronoiField()
866 trianglelist[numtri]=DXTri(i, n_vertices.p, n_vertices.r); in ConnectVoronoiField()
894 trianglelist[numtri]=DXTri(i, n_vertices.r, n_vertices.p); in ConnectVoronoiField()
922 trianglelist[numtri]=DXTri(i, n_vertices.r, n_vertices.q); in ConnectVoronoiField()
[all …]
/dports/graphics/cogl/cogl-1.22.8/cogl/
H A Dcogl-primitive.c67 primitive->n_vertices = n_vertices; in cogl_primitive_new_with_attributes()
112 int n_vertices, in cogl_primitive_new() argument
121 va_start (ap, n_vertices); in cogl_primitive_new()
128 va_start (ap, n_vertices); in cogl_primitive_new()
141 int n_vertices, in cogl_primitive_new_p2() argument
165 int n_vertices, in cogl_primitive_new_p3() argument
189 int n_vertices, in cogl_primitive_new_p2c4() argument
219 int n_vertices, in cogl_primitive_new_p3c4() argument
493 return primitive->n_vertices; in cogl_primitive_get_n_vertices()
502 primitive->n_vertices = n_vertices; in cogl_primitive_set_n_vertices()
[all …]
H A Dcogl-primitive.h252 int n_vertices,
278 int n_vertices,
333 int n_vertices,
387 int n_vertices,
443 int n_vertices,
499 int n_vertices,
555 int n_vertices,
611 int n_vertices,
667 int n_vertices,
723 int n_vertices,
[all …]
/dports/x11-wm/muffin/muffin-4.8.0/cogl/cogl/
H A Dcogl-primitive.c67 primitive->n_vertices = n_vertices; in cogl_primitive_new_with_attributes()
112 int n_vertices, in cogl_primitive_new() argument
121 va_start (ap, n_vertices); in cogl_primitive_new()
128 va_start (ap, n_vertices); in cogl_primitive_new()
141 int n_vertices, in cogl_primitive_new_p2() argument
165 int n_vertices, in cogl_primitive_new_p3() argument
189 int n_vertices, in cogl_primitive_new_p2c4() argument
219 int n_vertices, in cogl_primitive_new_p3c4() argument
493 return primitive->n_vertices; in cogl_primitive_get_n_vertices()
502 primitive->n_vertices = n_vertices; in cogl_primitive_set_n_vertices()
[all …]
H A Dcogl-primitive.h254 int n_vertices,
280 int n_vertices,
335 int n_vertices,
389 int n_vertices,
445 int n_vertices,
501 int n_vertices,
557 int n_vertices,
613 int n_vertices,
669 int n_vertices,
725 int n_vertices,
[all …]
/dports/x11-wm/mutter/mutter-41.1/cogl/cogl/
H A Dcogl-primitive.c65 primitive->n_vertices = n_vertices; in cogl_primitive_new_with_attributes()
110 int n_vertices, in cogl_primitive_new() argument
119 va_start (ap, n_vertices); in cogl_primitive_new()
126 va_start (ap, n_vertices); in cogl_primitive_new()
139 int n_vertices, in cogl_primitive_new_p2() argument
163 int n_vertices, in cogl_primitive_new_p3() argument
187 int n_vertices, in cogl_primitive_new_p2c4() argument
217 int n_vertices, in cogl_primitive_new_p3c4() argument
486 return primitive->n_vertices; in cogl_primitive_get_n_vertices()
495 primitive->n_vertices = n_vertices; in cogl_primitive_set_n_vertices()
[all …]
H A Dcogl-primitive.h255 int n_vertices,
281 int n_vertices,
336 int n_vertices,
390 int n_vertices,
446 int n_vertices,
502 int n_vertices,
558 int n_vertices,
614 int n_vertices,
670 int n_vertices,
726 int n_vertices,
[all …]
/dports/math/oink/oink-c1259fe/src/
H A Dgame.cpp33 n_vertices = 0; in Game()
54 for (int i=0; i<n_vertices; i++) { in ~Game()
81 n_vertices = vcount; in Game()
722 if (n_vertices == 0) return 0; in inflate()
821 bitset sel(n_vertices); in extract_subgame()
908 std::swap(n_vertices, other.n_vertices); in swap()
957 n_vertices = v_allocated; in v_sizeup()
977 n_vertices = newsize; in v_resize()
978 _owner.resize(n_vertices); in v_resize()
979 solved.resize(n_vertices); in v_resize()
[all …]
/dports/math/openmesh/OpenMesh-8.1/src/OpenMesh/Apps/ProgViewer/
H A DProgViewerWidget.cc166 std::cerr << mesh_.n_vertices() << " vertices, " in open_prog_mesh()
180 size_t n_vertices = mesh_.n_vertices(); in refine() local
190 ++n_vertices; in refine()
196 std::cerr << n_vertices << " vertices\n"; in refine()
205 size_t n_vertices = mesh_.n_vertices(); in coarsen() local
216 --n_vertices; in coarsen()
223 std::cerr << n_vertices << " vertices\n"; in coarsen()
235 coarsen(mesh_.n_vertices()-1); in keyPressEvent()
237 coarsen((unsigned int)(0.9*mesh_.n_vertices())); in keyPressEvent()
243 refine(mesh_.n_vertices()+1); in keyPressEvent()
[all …]
/dports/science/code_saturne/code_saturne-7.1.0/src/cdo/
H A Dcs_mesh_deform.c339 if (_vd_size != m->n_vertices) { in cs_mesh_deform_prescribe_displacement()
340 _vd_size = m->n_vertices; in cs_mesh_deform_prescribe_displacement()
351 for (cs_lnum_t i = 0; i < n_vertices; i++) { in cs_mesh_deform_prescribe_displacement()
360 for (cs_lnum_t i = 0; i < n_vertices; i++) { in cs_mesh_deform_prescribe_displacement()
400 _n_fixed_vertices = n_vertices; in cs_mesh_deform_force_displacements()
402 cs_gnum_t n_g_v = n_vertices; in cs_mesh_deform_force_displacements()
408 for (cs_lnum_t i = 0; i < n_vertices; i++) in cs_mesh_deform_force_displacements()
413 for (cs_lnum_t i = 0; i < n_vertices; i++) in cs_mesh_deform_force_displacements()
419 for (cs_lnum_t i = 0; i < n_vertices; i++) { in cs_mesh_deform_force_displacements()
456 assert(_vd_size == m->n_vertices); in cs_mesh_deform_solve_displacement()
[all …]
/dports/science/code_saturne/code_saturne-7.1.0/src/fvm/
H A Dfvm_tesselation.c262 cs_lnum_t n_vertices; in _added_vertex_coords() local
508 cs_lnum_t n_vertices; in _polyhedron_vertices() local
956 if (n_vertices == 4) in _tesselate_polygons()
1405 cs_lnum_t n_vertices; in _decode_polygons_tesselation_g() local
1474 k = n_vertices; in _decode_polygons_tesselation_g()
1535 cs_lnum_t n_vertices; in _decode_polygons_tesselation_l() local
1598 j = n_vertices; in _decode_polygons_tesselation_l()
1651 cs_lnum_t n_vertices; in _decode_polyhedra_tesselation_g() local
1748 l = n_vertices; in _decode_polyhedra_tesselation_g()
1829 cs_lnum_t n_vertices; in _decode_polyhedra_tesselation_l() local
[all …]
H A Dfvm_triangulate.c153 for (j = 0; j < n_vertices; j++) in _polygon_plane_3d()
155 face_center[i] /= n_vertices; in _polygon_plane_3d()
163 for (j = 0; j < n_vertices; j++) { in _polygon_plane_3d()
167 if (j < n_vertices - 1) in _polygon_plane_3d()
184 for (j = 0; j < n_vertices; j++) in _polygon_plane_3d()
216 for (j = 0; j < n_vertices; j++) { in _polygon_plane_3d()
278 for (j = 0; j < n_vertices; j++) { in _polygon_plane_3d()
348 if (i == n_vertices) in _polygon_vertex_is_ear()
561 const int n_edges = n_vertices*(n_vertices - 1)/2; in _polygon_delaunay_flip()
1095 if (n_vertices == 4) in fvm_triangulate_polygon()
[all …]
H A Dfvm_nodal_triangulate.c128 n_triangles_tot += n_vertices - 2; in _triangulate_section()
129 if (n_vertices > n_vertices_max) in _triangulate_section()
130 n_vertices_max = n_vertices; in _triangulate_section()
186 if (n_vertices >= 4) { in _triangulate_section()
188 if (n_vertices == 4) in _triangulate_section()
232 else if (n_vertices == 3) { in _triangulate_section()
330 if (n_vertices == 4) in _triangulate_section_polygons()
334 if (n_vertices > n_vertices_max) in _triangulate_section_polygons()
335 n_vertices_max = n_vertices; in _triangulate_section_polygons()
394 if (n_vertices == 4) { in _triangulate_section_polygons()
[all …]
H A Dfvm_nodal_project.c104 cs_lnum_t n_vertices, n_elements; in _faces_to_edges() local
159 n_vertices = base_section->stride; in _faces_to_edges()
186 for (k = 1; k < n_vertices ; k++) { in _faces_to_edges()
416 cs_lnum_t n_vertices = 0; in fvm_nodal_project() local
424 n_vertices = this_nodal->n_vertices; in fvm_nodal_project()
427 for (i = 0; i < n_vertices; i++) in fvm_nodal_project()
497 cs_lnum_t n_vertices = 0; in fvm_nodal_project_coords() local
502 n_vertices = this_nodal->n_vertices; in fvm_nodal_project_coords()
520 for (i = 0; i < n_vertices; i++) { in fvm_nodal_project_coords()
527 for (i = 0; i < n_vertices; i++) { in fvm_nodal_project_coords()
[all …]
/dports/graphics/py-pyglet150/pyglet-1.5.0/tests/integration/graphics/
H A Dgraphics_common.py61 self.n_vertices = 36
62 self.v3f_data = [v/float(self.n_vertices*3) for v in range(self.n_vertices * 3)]
63 self.v2f_data = [v/float(self.n_vertices*2) for v in range(self.n_vertices * 2)]
64 self.c4f_data = [v/float(self.n_vertices*4) for v in range(self.n_vertices * 4)]
65 self.c3f_data = [v/float(self.n_vertices*3) for v in range(self.n_vertices * 3)]
66 self.t4f_data = [v/float(self.n_vertices*4) for v in range(self.n_vertices * 4)]
67 self.t3f_data = [v/float(self.n_vertices*3) for v in range(self.n_vertices * 3)]
68 self.t2f_data = [v/float(self.n_vertices*2) for v in range(self.n_vertices * 2)]
204 self.index_data = list(range(self.n_vertices//2)) * 2
/dports/graphics/py-pyglet/pyglet-1.5.21/tests/integration/graphics/
H A Dgraphics_common.py61 self.n_vertices = 36
62 self.v3f_data = [v/float(self.n_vertices*3) for v in range(self.n_vertices * 3)]
63 self.v2f_data = [v/float(self.n_vertices*2) for v in range(self.n_vertices * 2)]
64 self.c4f_data = [v/float(self.n_vertices*4) for v in range(self.n_vertices * 4)]
65 self.c3f_data = [v/float(self.n_vertices*3) for v in range(self.n_vertices * 3)]
66 self.t4f_data = [v/float(self.n_vertices*4) for v in range(self.n_vertices * 4)]
67 self.t3f_data = [v/float(self.n_vertices*3) for v in range(self.n_vertices * 3)]
68 self.t2f_data = [v/float(self.n_vertices*2) for v in range(self.n_vertices * 2)]
204 self.index_data = list(range(self.n_vertices//2)) * 2
/dports/science/code_saturne/code_saturne-7.1.0/src/alge/
H A Dcs_cell_to_vertex.c233 const cs_lnum_t n_vertices = m->n_vertices; in _cell_to_vertex_w_unweighted() local
241 BFT_REALLOC(w, n_vertices, cs_weight_t); in _cell_to_vertex_w_unweighted()
242 BFT_MALLOC(w_sum, n_vertices, int); in _cell_to_vertex_w_unweighted()
265 m->n_vertices, in _cell_to_vertex_w_unweighted()
295 const cs_lnum_t n_vertices = m->n_vertices; in _cell_to_vertex_w_inv_distance() local
370 m->n_vertices, in _cell_to_vertex_w_inv_distance()
420 const cs_lnum_t n_vertices = m->n_vertices; in _cell_to_vertex_f_lsq() local
430 cs_lnum_t w_size = n_vertices*10; in _cell_to_vertex_f_lsq()
532 const cs_lnum_t n_vertices = m->n_vertices; in _cell_to_vertex_scalar() local
741 cs_lnum_t rhs_size = n_vertices*4; in _cell_to_vertex_scalar()
[all …]
/dports/games/crack-attack/crack-attack-1.1.14/src/
H A Dobj_block.cxx1397 int n_vertices; in generateBlockDisplayList() local
1401 n_vertices = 12; in generateBlockDisplayList()
1405 n_vertices = 72; in generateBlockDisplayList()
1409 n_vertices = 504; in generateBlockDisplayList()
1416 glDrawArrays(GL_TRIANGLES, 0, n_vertices); in generateBlockDisplayList()
1424 GLfloat *tex_coords = new GLfloat[3 * n_vertices]; in generateBlockDisplayList()
1425 for (int n = 3 * n_vertices; n--; ) in generateBlockDisplayList()
1432 glDrawArrays(GL_TRIANGLES, 0, n_vertices); in generateBlockDisplayList()
1448 for (int n = 3 * n_vertices; n -=3; ) { in generateBlockDisplayList()
1466 for (int n = 0; n < 3 * n_vertices; ++n) { in generateBlockDisplayList()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/platform/geometry/
H A Dfloat_polygon.cc58 unsigned n_vertices, in NextVertexIndex() argument
61 n_vertices; in NextVertexIndex()
67 unsigned n_vertices = polygon.NumberOfVertices(); in FindNextEdgeVertexIndex() local
69 NextVertexIndex(vertex_index1, n_vertices, clockwise); in FindNextEdgeVertexIndex()
77 NextVertexIndex(vertex_index2, n_vertices, clockwise); in FindNextEdgeVertexIndex()
90 unsigned n_vertices = NumberOfVertices(); in FloatPolygon() local
91 edges_.resize(n_vertices); in FloatPolygon()
92 empty_ = n_vertices < 3; in FloatPolygon()
94 if (n_vertices) in FloatPolygon()
101 for (unsigned i = 1; i < n_vertices; ++i) { in FloatPolygon()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/platform/geometry/
H A Dfloat_polygon.cc58 unsigned n_vertices, in NextVertexIndex() argument
61 n_vertices; in NextVertexIndex()
67 unsigned n_vertices = polygon.NumberOfVertices(); in FindNextEdgeVertexIndex() local
69 NextVertexIndex(vertex_index1, n_vertices, clockwise); in FindNextEdgeVertexIndex()
77 NextVertexIndex(vertex_index2, n_vertices, clockwise); in FindNextEdgeVertexIndex()
90 unsigned n_vertices = NumberOfVertices(); in FloatPolygon() local
91 edges_.resize(n_vertices); in FloatPolygon()
92 empty_ = n_vertices < 3; in FloatPolygon()
94 if (n_vertices) in FloatPolygon()
101 for (unsigned i = 1; i < n_vertices; ++i) { in FloatPolygon()
[all …]
/dports/science/code_saturne/code_saturne-7.1.0/src/lagr/
H A Dcs_lagr_new.c190 acc_surf_r[n_vertices-1] = -1; in _face_sub_surfaces()
192 acc_surf_r[n_vertices-1] = 1; in _face_sub_surfaces()
238 if (tri_id < n_vertices) { in _random_point_in_face()
334 if (n_vertices > n_vertices_max) { in cs_lagr_new()
335 n_vertices_max = n_vertices*2; in cs_lagr_new()
339 _face_sub_surfaces(n_vertices, in cs_lagr_new()
359 _random_point_in_face(n_vertices, in cs_lagr_new()
447 cs_lnum_t face_id, n_vertices; in cs_lagr_new_v() local
493 = _face_sub_surfaces(n_vertices, in cs_lagr_new_v()
558 cs_lnum_t face_id, n_vertices; in cs_lagr_new_v() local
[all …]

12345678910>>...44