Home
last modified time | relevance | path

Searched refs:vertex_list (Results 1 – 25 of 306) sorted by relevance

12345678910>>...13

/dports/astro/openuniverse/openuniverse-1.0beta3/src/
H A Drings.cpp55 pdata->vertex_list = in Ring()
72 pdata->vertex_list[s * 2].u = 1.0; in Ring()
73 pdata->vertex_list[s * 2].v = 0.0; in Ring()
75 pdata->vertex_list[s * 2].u = 1.0; in Ring()
76 pdata->vertex_list[s * 2].v = 1.0; in Ring()
81 pdata->vertex_list[s * 2].z = 0.0; in Ring()
88 pdata->vertex_list[s * 2].r = in Ring()
89 pdata->vertex_list[s * 2].g = in Ring()
117 pdata->vertex_list[s * 2 + 1].r = in Ring()
149 pdata->vertex_list[s * 2].r = in Ring()
[all …]
/dports/cad/uranium/Uranium-3ed9c4de/plugins/FileHandlers/OBJReader/
H A DOBJReader.py24 vertex_list = []
55 vertex_list.append([float(parts[1]), float(parts[3]), -float(parts[2])])
64 num_vertices = len(vertex_list)
98 …vertex_list[i][0], vertex_list[i][1], vertex_list[i][2], normal_list[ni][0], normal_list[ni][1], n…
100 …vertex_list[i][0], vertex_list[i][1], vertex_list[i][2], vertex_list[j][0], vertex_list[j][1], ver…
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/unit/
H A DBCDTest.cpp106 vector<Mesh::VertexHandle> vertex_list; in compare_bcd() local
135 mesh.get_all_vertices( vertex_list, err ); ASSERT_NO_ERROR(err); in compare_bcd()
136 CPPUNIT_ASSERT(!vertex_list.empty()); in compare_bcd()
137 initial_coords.resize( vertex_list.size() ); in compare_bcd()
138 …mesh.vertices_get_coordinates( arrptr(vertex_list), arrptr(initial_coords), vertex_list.size(), er… in compare_bcd()
145 global_coords.resize( vertex_list.size() ); in compare_bcd()
146 …mesh.vertices_get_coordinates( arrptr(vertex_list), arrptr(global_coords), vertex_list.size(), err… in compare_bcd()
150 for (i = 0; i < vertex_list.size(); ++i) { in compare_bcd()
151 mesh.vertex_set_coordinates( vertex_list[i], initial_coords[i], err ); in compare_bcd()
159 bcd_coords.resize( vertex_list.size() ); in compare_bcd()
[all …]
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/include/pcl/surface/impl/
H A Dmarching_cubes.hpp123 vertex_list.resize (12); in createSurface()
125 interpolateEdge (p[0], p[1], leaf_node[0], leaf_node[1], vertex_list[0]); in createSurface()
127 interpolateEdge (p[1], p[2], leaf_node[1], leaf_node[2], vertex_list[1]); in createSurface()
129 interpolateEdge (p[2], p[3], leaf_node[2], leaf_node[3], vertex_list[2]); in createSurface()
131 interpolateEdge (p[3], p[0], leaf_node[3], leaf_node[0], vertex_list[3]); in createSurface()
133 interpolateEdge (p[4], p[5], leaf_node[4], leaf_node[5], vertex_list[4]); in createSurface()
135 interpolateEdge (p[5], p[6], leaf_node[5], leaf_node[6], vertex_list[5]); in createSurface()
137 interpolateEdge (p[6], p[7], leaf_node[6], leaf_node[7], vertex_list[6]); in createSurface()
153 p1.getVector3fMap () = vertex_list[triTable[cubeindex][i]]; in createSurface()
155 p2.getVector3fMap () = vertex_list[triTable[cubeindex][i+1]]; in createSurface()
[all …]
/dports/math/gap/gap-4.11.0/pkg/qpa-version-1.30/lib/
H A Dquivergraphalgorithms.gi19 vert, vertex_list, res, tsorted;
48 Add(tsorted, vertex_list[v]);
54 vertex_list := VerticesOfQuiver(Q);
56 for vert in [1 .. Length(vertex_list) ] do
92 vertex_list, res, vert;
121 vertex_list := VerticesOfQuiver(Q);
123 if Length(vertex_list) = 0 then
155 vertex_list, res, vert, i;
200 vertex_list := VerticesOfQuiver(Q);
435 Add(comp_verts, vertex_list[v]);
[all …]
/dports/graphics/py-glooey/glooey-0.3.3/docs/how_it_all_works/
H A Ddrawing.py12 self.vertex_list = None
28 if self.vertex_list is None:
29 self.vertex_list = self.batch.add(
34 self.vertex_list.vertices = vertices
37 if self.vertex_list is not None:
38 self.vertex_list.delete()
39 self.vertex_list = None
/dports/devel/allegro5/allegro5-5.2.7.0/addons/primitives/
H A Dtriangulator.c48 _AL_LIST* vertex_list; member
364 _AL_LIST* vertex_list; in poly_initialize() local
383 vertex_list = _al_list_create_static(vertex_count); in poly_initialize()
399 _al_list_destroy(vertex_list); in poly_initialize()
408 polygon->vertex_list = vertex_list; in poly_initialize()
414 _al_list_push_back(vertex_list, POLY_VERTEX(i)); in poly_initialize()
454 …y_classify_vertices_in_range(first_vertex, _al_list_next(vertex_list, last_vertex), vertex_list, r… in poly_initialize()
694 …for (item = _al_list_front(polygon->vertex_list); item; item = _al_list_next(polygon->vertex_list,… in poly_do_triangulate()
762 …for (item = _al_list_front(polygon->vertex_list); item; item = _al_list_next(polygon->vertex_list,… in poly_do_triangulate()
799 _al_list_erase(polygon->vertex_list, vertex_item); in poly_do_triangulate()
[all …]
/dports/games/d2x/d2x-0.2.5/main/
H A Dgameseg.c313 int vertex_list[6]; in get_seg_masks() local
351 vertnum = min(vertex_list[0],vertex_list[2]); in get_seg_masks()
357 if (vertex_list[4] < vertex_list[1]) in get_seg_masks()
459 int vertex_list[6]; in get_side_dists() local
500 vertnum = min(vertex_list[0],vertex_list[2]); in get_side_dists()
506 if (vertex_list[4] < vertex_list[1]) in get_side_dists()
674 vertex_list[0],vertex_list[1],vertex_list[2],vertex_list[3], in check_segment_connections()
695 vertex_list[0],vertex_list[1],vertex_list[2],vertex_list[3],vertex_list[4],vertex_list[5], in check_segment_connections()
716 vertex_list[0],vertex_list[1],vertex_list[2],vertex_list[3],vertex_list[4],vertex_list[5], in check_segment_connections()
1534 int vertex_list[6]; in create_walls_on_side() local
[all …]
H A Dfvi.c221 v0 = &Vertices[vertex_list[facenum*3+edgenum]]; in check_sphere_to_face()
272 int vertex_list[6]; in check_line_to_face() local
290 vertnum = min(vertex_list[0],vertex_list[2]); in check_line_to_face()
294 vertnum = vertex_list[0]; in check_line_to_face()
296 if (vertex_list[i] < vertnum) in check_line_to_face()
297 vertnum = vertex_list[i]; in check_line_to_face()
371 int vertex_list[6]; in special_check_line_to_face() local
398 edge_v0 = &Vertices[vertex_list[facenum*3+edgenum]]; in special_check_line_to_face()
1157 int vertex_list[6],vertnum_list[6]; in find_hitpoint_uv() local
1306 int num_faces,vertex_list[6]; in sphere_intersects_wall() local
[all …]
/dports/devel/py-trimesh/trimesh-3.5.25/trimesh/viewer/
H A Dwidget.py137 self.vertex_list = {}
165 while self.vertex_list:
166 _, vertex = self.vertex_list.popitem()
184 if not self.vertex_list:
192 vertex_list = self.vertex_list[geometry_name]
203 vertex_list,
220 if not self.vertex_list:
222 for vertex_list in self.vertex_list.values():
223 vertex_list.delete()
226 self.vertex_list = {}
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/oul/ouml/
H A Dpolygon_mesh.cxx32 vertex_list.push_back(pt); in add_vertex()
33 return vertex_list.size()-1; in add_vertex()
52 if (vertex_list.capacity()<=(unsigned int)index) in set_vertex()
53 vertex_list.reserve(index+100); in set_vertex()
54 vertex_list[index] = pt; in set_vertex()
110 if ((unsigned int)index>=vertex_list.size()) in get_vertex()
115 return vertex_list[index]; in get_vertex()
140 poly.push_back(vertex_list[i]); in get_face()
/dports/graphics/geomview/geomview-1.9.5/src/lib/gprim/lincoln/
H A Dlincolnload.c48 struct vertex *vertex_list; in LincolnFLoad() local
64 vertex_list = OOGLNewNE(struct vertex, header.nvertices, "Lincoln vertices"); in LincolnFLoad()
68 if(iobfread(vertex_list,sizeof(struct vertex),header.nvertices,inf) <= 0 in LincolnFLoad()
73 for (vp = vertex_list; vp<vertex_list+header.nvertices; vp++) { in LincolnFLoad()
79 CONV(ep->v0,vertex_list); in LincolnFLoad()
80 CONV(ep->v1,vertex_list); in LincolnFLoad()
123 Vertex *v = &v_list[vp - vertex_list]; in LincolnFLoad()
140 OOGLFree((char*)vertex_list); in LincolnFLoad()
/dports/graphics/graphviz/graphviz-2.44.1/tclpkg/tclpathplan/
H A Dwrapper.c91 void find_ints(struct vertex vertex_list[], struct polygon polygon_list[],
99 struct vertex *vertex_list; in Plegal_arrangement() local
110 vertex_list = (struct vertex *) in Plegal_arrangement()
114 polygon_list[i].start = &vertex_list[vno]; in Plegal_arrangement()
116 vertex_list[vno].pos.x = polys[i]->ps[j].x; in Plegal_arrangement()
117 vertex_list[vno].pos.y = polys[i]->ps[j].y; in Plegal_arrangement()
118 vertex_list[vno].poly = &polygon_list[i]; in Plegal_arrangement()
121 polygon_list[i].finish = &vertex_list[vno - 1]; in Plegal_arrangement()
127 find_ints(vertex_list, polygon_list, &input, ilist); in Plegal_arrangement()
163 free(vertex_list); in Plegal_arrangement()
/dports/graphics/py-glooey/glooey-0.3.3/glooey/
H A Dmisc.py39 self.vertex_list = None
46 if self.vertex_list is not None:
48 self.vertex_list, pyglet.gl.GL_LINES,
52 if self.vertex_list is None:
53 self.vertex_list = self.batch.add(
71 self.vertex_list.vertices = (
85 self.vertex_list.colors = 12 * color.tuple
88 if self.vertex_list is not None:
89 self.vertex_list.delete()
90 self.vertex_list = None
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/io/
H A DReadVtk.hpp75 Range& vertex_list,
79 Range& vertex_list,
83 Range& vertex_list,
87 Range& vertex_list,
91 Range& vertex_list,
99 Range& vertex_list,
/dports/games/dxx-rebirth/dxx-rebirth_20211220-src/similar/main/
H A Dgameseg.cpp314 const auto vertnum = min(vertex_list[0],vertex_list[2]); in get_seg_masks()
317 auto a = vertex_list[4] < vertex_list[1] in get_seg_masks()
360 auto b = begin(vertex_list); in get_seg_masks()
411 const auto vertnum = min(vertex_list[0],vertex_list[2]); in get_side_dists()
414 auto a = vertex_list[4] < vertex_list[1] in get_side_dists()
456 auto b = begin(vertex_list); in get_side_dists()
550 vertex_list[0] != con_vertex_list[t] || in check_segment_connections()
566 vertex_list[0] != con_vertex_list[2] || in check_segment_connections()
567 vertex_list[2] != con_vertex_list[0] || in check_segment_connections()
568 vertex_list[3] != con_vertex_list[5] || in check_segment_connections()
[all …]
/dports/math/polymake/polymake-4.5/apps/polytope/src/
H A Dfacets_from_incidence.cc52 for (auto vertex_list=entire(rows(VIF)); !vertex_list.at_end(); ++vertex_list, ++Fi) {
53 assign_facet_through_points(V.minor(*vertex_list,All) / L/ AH, Fi->top());
54 Int outer_vertex = (sequence(0,V.rows()) - *vertex_list).front();
/dports/graphics/py-pyglet150/pyglet-1.5.0/tests/interactive/text/
H A Dtest_inline_elements_style_change.py41 vertex_list = None variable in TestElement
46 self.vertex_list = layout.batch.add(4, pyglet.gl.GL_QUADS,
54 self.vertex_list.vertices[:] = (x, y,
59 self.vertex_list.delete()
60 del self.vertex_list
H A Dtest_inline_elements.py69 vertex_list = None variable in TestElement
72 self.vertex_list = layout.batch.add(4, pyglet.gl.GL_QUADS,
80 self.vertex_list.vertices[:] = (x, y,
85 self.vertex_list.delete()
86 del self.vertex_list
/dports/graphics/py-pyglet/pyglet-1.5.21/tests/interactive/text/
H A Dtest_inline_elements_style_change.py41 vertex_list = None variable in TestElement
46 self.vertex_list = layout.batch.add(4, pyglet.gl.GL_QUADS,
54 self.vertex_list.vertices[:] = (x, y,
59 self.vertex_list.delete()
60 del self.vertex_list
H A Dtest_inline_elements.py69 vertex_list = None variable in TestElement
72 self.vertex_list = layout.batch.add(4, pyglet.gl.GL_QUADS,
80 self.vertex_list.vertices[:] = (x, y,
85 self.vertex_list.delete()
86 del self.vertex_list
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/btol/tests/
H A Dtest_face_algs.cxx37 vertex_list verts; f->vertices(verts); in print_verts()
59 vertex_list verts; in test_face_algs()
65 vertex_list hole_verts; in test_face_algs()
73 vertex_list chain_verts; outside_chain->vertices(chain_verts); in test_face_algs()
103 vertex_list* mf_verts = multi_f->outside_boundary_vertices(); in test_face_algs()
110 vertex_list mf_hole_verts; (*holes)[0]->vertices(mf_hole_verts); in test_face_algs()
/dports/graphics/py-pyglet/pyglet-1.5.21/tests/integration/graphics/
H A Dtest_retained_drawing.py14 vertex_list = pyglet.graphics.vertex_list(self.n_vertices, *data)
15 return get_feedback(lambda: vertex_list.draw(GL_TRIANGLES))
/dports/graphics/py-pyglet150/pyglet-1.5.0/tests/integration/graphics/
H A Dtest_retained_drawing.py14 vertex_list = pyglet.graphics.vertex_list(self.n_vertices, *data)
15 return get_feedback(lambda: vertex_list.draw(GL_TRIANGLES))
/dports/misc/vxl/vxl-3.3.2/contrib/gel/vtol/
H A Dvtol_edge.cxx130 vertex_list verts; vertices(verts); in set_vertices_from_zero_chains()
259 vertex_list *vtol_edge::endpoints() { in endpoints()
260 auto *newl=new vertex_list; in endpoints()
275 vertex_list thisvert; this->vertices(thisvert); in share_vertex_with()
276 vertex_list everts; other->vertices(everts); in share_vertex_with()
277 for (vertex_list::const_iterator i1=thisvert.begin();i1!=thisvert.end(); ++i1) in share_vertex_with()
278 for (vertex_list::const_iterator i2=everts.begin();i2!=everts.end(); ++i2) in share_vertex_with()

12345678910>>...13