| /dports/graphics/py-box2d-py/box2d-py-2.3.8/examples/ |
| H A D | box_cutter.py | 46 new_vertices = [[], []]
51 verts = new_vertices[0]
53 verts = new_vertices[1]
57 if last_verts == new_vertices[0]:
63 elif last_verts == new_vertices[1]:
75 cut_added[0] = len(new_vertices[0])
76 new_vertices[0].append(b2Vec2(local_exit))
77 new_vertices[0].append(b2Vec2(local_entry))
79 cut_added[1] = len(new_vertices[1])
81 new_vertices[1].append(b2Vec2(local_exit))
[all …]
|
| /dports/x11/xlockmore/xlockmore-5.67/modes/glx/ |
| H A D | bubble3d.c | 212 glb_vertex *new_vertices; in glb_bubble_draw() local
224 new_vertices[i][0] = vertices[i][0] * (s + 1); in glb_bubble_draw()
225 new_vertices[i][1] = vertices[i][1] * (s + 1); in glb_bubble_draw()
226 new_vertices[i][2] = vertices[i][2] * (s + 1); in glb_bubble_draw()
243 glNormal3fv(new_vertices[triangles[i][0]]); in glb_bubble_draw()
244 glVertex3fv(new_vertices[triangles[i][0]]); in glb_bubble_draw()
245 glNormal3fv(new_vertices[triangles[i][1]]); in glb_bubble_draw()
246 glVertex3fv(new_vertices[triangles[i][1]]); in glb_bubble_draw()
247 glNormal3fv(new_vertices[triangles[i][2]]); in glb_bubble_draw()
248 glVertex3fv(new_vertices[triangles[i][2]]); in glb_bubble_draw()
[all …]
|
| /dports/x11/xscreensaver/xscreensaver-5.44/hacks/glx/ |
| H A D | bubble3d.c | 226 glb_vertex *new_vertices; in glb_bubble_draw() local
238 new_vertices[i][0] = vertices[i][0] * (s + 1); in glb_bubble_draw()
239 new_vertices[i][1] = vertices[i][1] * (s + 1); in glb_bubble_draw()
240 new_vertices[i][2] = vertices[i][2] * (s + 1); in glb_bubble_draw()
261 glNormal3fv(new_vertices[triangles[i][0]]); in glb_bubble_draw()
262 glVertex3fv(new_vertices[triangles[i][0]]); in glb_bubble_draw()
263 glNormal3fv(new_vertices[triangles[i][1]]); in glb_bubble_draw()
264 glVertex3fv(new_vertices[triangles[i][1]]); in glb_bubble_draw()
265 glNormal3fv(new_vertices[triangles[i][2]]); in glb_bubble_draw()
266 glVertex3fv(new_vertices[triangles[i][2]]); in glb_bubble_draw()
[all …]
|
| /dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/curve/ |
| H A D | mitshairfilereader.cpp | 110 vector<Vector3f> vertices, new_vertices; in read_curves() local
136 assert(new_vertices.empty()); in read_curves()
139 new_vertices.push_back(vertices[i]); in read_curves()
144 new_vertices.push_back(0.5f * (vertices[i] + vertices[i + 1])); in read_curves()
148 for (size_t i = 0, e = new_vertices.size(); i + 3 < e; i += 3) in read_curves()
149 push_vertex_properties(new_vertices[i], builder); in read_curves()
159 clear_keep_memory(new_vertices); in read_curves()
|
| /dports/games/vamos/vamos-0.7.1/media/ |
| H A D | Ac3d.cc | 386 const Surface_Vertices& new_vertices);
389 const Surface_Vertices& new_vertices);
442 new_vertices)) in join_surface()
452 old_vertices, new_vertices); in join_surface()
473 old_vertices, new_vertices); in join_surface()
479 old_vertices, new_vertices); in join_surface()
490 const Surface_Vertices& new_vertices) in join_quadrilateral_to_edge() argument
517 const Surface_Vertices& new_vertices) in join_triangle_to_edge() argument
569 size_t n_new_vertices = new_vertices.size (); in join_quadrilateral()
589 back ()->add_vertex (new_vertices [new_index4]); in join_quadrilateral()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/gel/vsol/ |
| H A D | vsol_polygon_3d.cxx | 42 vsol_polygon_3d::vsol_polygon_3d(std::vector<vsol_point_3d_sptr> const& new_vertices) in vsol_polygon_3d() argument
45 assert(new_vertices.size()>=3); in vsol_polygon_3d()
46 assert(valid_vertices(new_vertices)); in vsol_polygon_3d()
48 storage_=new std::vector<vsol_point_3d_sptr>(new_vertices); in vsol_polygon_3d()
222 bool vsol_polygon_3d::valid_vertices(const std::vector<vsol_point_3d_sptr> new_vertices) const in valid_vertices()
225 if (new_vertices.size() <= 3) return true; // a triangle is always in a plane in valid_vertices()
227 vsol_point_3d_sptr p0=new_vertices[0]; in valid_vertices()
228 vsol_point_3d_sptr p1=new_vertices[1]; in valid_vertices()
229 vsol_point_3d_sptr p2=new_vertices[2]; in valid_vertices()
240 for (unsigned int i=3;i<new_vertices.size();++i) in valid_vertices()
[all …]
|
| H A D | vsol_rectangle_3d.cxx | 139 bool vsol_rectangle_3d::valid_vertices(const std::vector<vsol_point_3d_sptr> new_vertices) const in valid_vertices()
141 if (new_vertices.size() != 3) return false; in valid_vertices()
142 vgl_vector_3d<double> a=new_vertices[0]->to_vector(*(new_vertices[1])); in valid_vertices()
143 vgl_vector_3d<double> b=new_vertices[1]->to_vector(*(new_vertices[2])); in valid_vertices()
|
| H A D | vsol_rectangle_2d.cxx | 203 bool vsol_rectangle_2d::valid_vertices(const std::vector<vsol_point_2d_sptr> new_vertices) const in valid_vertices()
205 if (new_vertices.size() != 3) return false; in valid_vertices()
206 vgl_vector_2d<double> a=new_vertices[0]->to_vector(*(new_vertices[1])); in valid_vertices()
207 vgl_vector_2d<double> b=new_vertices[1]->to_vector(*(new_vertices[2])); in valid_vertices()
|
| H A D | vsol_polyhedron.cxx | 21 vsol_polyhedron::vsol_polyhedron(std::vector<vsol_point_3d_sptr> const& new_vertices) in vsol_polyhedron() argument
24 assert(new_vertices.size()>=4); in vsol_polyhedron()
26 storage_=new_vertices; // element-wise assignment in vsol_polyhedron()
|
| /dports/math/polymake/polymake-4.5/apps/polytope/src/ |
| H A D | minkowski_cone.cc | 113 NodeMap<Undirected,Vector<Rational> > new_vertices(G); // the vertices of the Minkowski summand in minkowski_cone_point() local
121 …new_vertices[0] = unit_vector<Rational>(edge_directions[0].dim(),0); // base vertex of the summan… in minkowski_cone_point()
132 new_vertices[*v] = new_vertices[current] - edge_directions[G.edge(current,*v)]; in minkowski_cone_point()
134 new_vertices[*v] = new_vertices[current] + edge_directions[G.edge(current,*v)]; in minkowski_cone_point()
141 "POINTS", Matrix<Rational>(new_vertices) / rays); in minkowski_cone_point()
|
| /dports/graphics/blender/blender-2.91.0/source/blender/freestyle/intern/winged_edge/ |
| H A D | WingedEdgeBuilder.cpp | 90 float *new_vertices; in buildWShape() local
93 new_vertices = new float[vsize]; in buildWShape()
98 transformVertices(vertices, vsize, *_current_matrix, new_vertices); in buildWShape()
102 memcpy(new_vertices, vertices, vsize * sizeof(*new_vertices)); in buildWShape()
132 buildWVertices(shape, new_vertices, vsize); in buildWShape()
151 buildTriangleStrip(new_vertices, in buildWShape()
163 buildTriangleFan(new_vertices, in buildWShape()
175 buildTriangles(new_vertices, in buildWShape()
198 delete[] new_vertices; in buildWShape()
|
| /dports/devel/py-trimesh/trimesh-3.5.25/trimesh/ |
| H A D | intersections.py | 523 new_vertices = vertices
540 np.arange(len(new_vertices),
541 len(new_vertices) +
553 new_vertices = np.append(new_vertices, new_quad_vertices, axis=0)
571 np.arange(len(new_vertices),
572 len(new_vertices) +
585 new_vertices = np.append(new_vertices, new_tri_vertices, axis=0)
591 minlength=len(new_vertices),
595 final_vert = new_vertices[unique]
|
| H A D | remesh.py | 86 new_vertices = np.vstack((vertices, mid))
100 return new_vertices, new_faces, new_attributes
102 return new_vertices, new_faces
|
| H A D | repair.py | 298 new_vertices = np.vstack((mesh.vertices, new_vertex))
300 new_vertices = mesh.vertices
309 new_normals, valid = triangles.normals(new_vertices[new_faces])
325 mesh.vertices = new_vertices
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/domhex/ |
| H A D | pointInsertion.cpp | 234 new_vertices.clear(); in treat_region()
326 new_vertices.push_back(individual); in treat_region()
344 std::cout << "nb new vertices= " << new_vertices.size() << std::endl; in treat_region()
365 for(unsigned int i = 0; i < new_vertices.size(); i++) delete new_vertices[i]; in treat_region()
366 new_vertices.clear(); in treat_region()
372 int Filler3D::get_nbr_new_vertices() { return new_vertices.size(); } in get_nbr_new_vertices()
374 MVertex *Filler3D::get_new_vertex(int i) { return new_vertices[i]; } in get_new_vertex()
392 std::vector<MVertex *> Filler3D::new_vertices; member in Filler3D
|
| /dports/math/polymake/polymake-4.5/apps/tropical/src/ |
| H A D | linear_space.cc | 50 ListMatrix<Vector<Rational> > new_vertices; in linear_space() local
82 new_vertices /= *nrows / *ncol; in linear_space()
95 new_vertices /= (Addition::orientation() * unit_vector<Rational>(n+1,i)); in linear_space()
109 new_vertices /= Addition::orientation() * v; in linear_space()
140 "PROJECTIVE_VERTICES", new_vertices, in linear_space()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Polyhedron_incremental_builder_3.h | 60 size_type new_vertices; variable
238 ++new_vertices; in add_vertex()
244 if ( i < new_vertices) in vertex()
351 CGAL_assertion( w < new_vertices); in lookup_hole()
400 CGAL_assertion( w < new_vertices); in lookup_halfedge()
401 CGAL_assertion( v < new_vertices); in lookup_halfedge()
555 new_vertices = 0; in begin_surface()
562 new_vertices = hds.size_of_vertices(); in begin_surface()
598 if ( v2 >= new_vertices) { in add_vertex_to_facet()
883 for ( std::size_t i = 0; i < new_vertices; i++) { in check_unconnected_vertices()
[all …]
|
| H A D | Linear_cell_complex_incremental_builder.h | 95 ++new_vertices;
108 CGAL_assertion( i<new_vertices );
160 new_vertices = 0;
205 size_type new_vertices;
|
| /dports/science/py-libpysal/libpysal-4.5.1/libpysal/cg/ |
| H A D | voronoi.py | 81 new_vertices = vor.vertices.tolist()
116 new_region.append(len(new_vertices))
117 new_vertices.append(far_point.tolist())
119 vs = np.asarray([new_vertices[v] for v in new_region])
126 regions_vertices = new_regions, np.asarray(new_vertices)
|
| /dports/devel/libarea/libarea-2752cd9/ |
| H A D | Curve.cpp | 157 if (new_vertices.size() > 1) in CheckAddedRadii()
196 CheckAddedRadii(new_vertices); in AddArcOrLines()
212 …if (It != might_be_an_arc.begin() || (new_vertices.size() == 0) || (new_vertices.back().m_p != v->… in AddArcOrLines()
214 new_vertices.push_back(*v); in AddArcOrLines()
215 CheckAddedRadii(new_vertices); in AddArcOrLines()
227 std::list<CVertex> new_vertices; in FitArcs() local
245 new_vertices.push_back(vt); in FitArcs()
270 …for (std::list<CVertex>::iterator It = new_vertices.begin(); It != new_vertices.end(); It++)m_vert… in FitArcs()
446 std::list<CVertex> new_vertices; in Reverse() local
461 new_vertices.push_back(new_v); in Reverse()
[all …]
|
| /dports/devel/py-trimesh/trimesh-3.5.25/trimesh/path/ |
| H A D | simplify.py | 405 new_vertices = []
417 len(new_vertices),
419 new_vertices.extend(circle)
425 entity.points += len(new_vertices)
427 new_vertices.extend(vertices)
432 vertices=new_vertices)
|
| /dports/math/cgal/CGAL-5.3/examples/Polygon_mesh_processing/ |
| H A D | refine_fair_example.cpp | 55 std::vector<Vertex_handle> new_vertices; in main() local
59 std::back_inserter(new_vertices), in main()
66 std::cout << "Refinement added " << new_vertices.size() << " vertices." << std::endl; in main()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/gel/vmal/ |
| H A D | vmal_convert_osl.cxx | 25 std::vector<vtol_vertex_sptr> new_vertices; in convert_edge_2d() local
28 new_vertices.push_back(new vtol_vertex_2d(x[i],y[i])); in convert_edge_2d()
29 out=new vtol_edge_2d(new vtol_zero_chain(new_vertices)); in convert_edge_2d()
|
| /dports/math/conauto/conauto-2.03/src/ |
| H A D | refinements.h | 33 uint8_t set_ref_compat ( SeqPart *sp, const struct graph *g, int level, uint16_t *new_vertices, uin…
35 … SeqPart *sp, const struct graph *g, int level, uint16_t p, uint16_t *new_vertices, uint16_t *old_…
|
| /dports/misc/vxl/vxl-3.3.2/contrib/gel/vtol/ |
| H A D | vtol_zero_chain.cxx | 67 vtol_zero_chain::vtol_zero_chain(const vertex_list &new_vertices) in vtol_zero_chain() argument
70 assert(new_vertices.size()>0); in vtol_zero_chain()
72 for (const auto & new_vertice : new_vertices) in vtol_zero_chain()
|