| /dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/tests/unit/ |
| H A D | unit_Geometry.cpp | 161 vertices2[0]=Point(0.,0.,0.); in unit_Geometry()
162 vertices2[1]=Point(2.,0.,0.); in unit_Geometry()
163 vertices2[2]=Point(2.,0.,1.); in unit_Geometry()
164 vertices2[3]=Point(0.,0.,1.); in unit_Geometry()
166 vertices2[0]=Point(2.,0.,0.); in unit_Geometry()
167 vertices2[1]=Point(3.,1.,0.); in unit_Geometry()
168 vertices2[2]=Point(3.,1.,1.); in unit_Geometry()
171 vertices2[0]=Point(3.,1.,0.); in unit_Geometry()
172 vertices2[1]=Point(1.,4.,0.); in unit_Geometry()
173 vertices2[2]=Point(1.,4.,1.); in unit_Geometry()
[all …]
|
| /dports/deskutils/cairo-dock/cairo-dock-core-3.4.1/src/gldit/ |
| H A D | cairo-dock-particle-system.c | 111 vertices2[0] = x - w; in cairo_dock_render_particles_full()
112 vertices2[2] = z; in cairo_dock_render_particles_full()
113 vertices2[3] = x - w; in cairo_dock_render_particles_full()
114 vertices2[5] = z; in cairo_dock_render_particles_full()
115 vertices2[6] = x + w; in cairo_dock_render_particles_full()
116 vertices2[8] = z; in cairo_dock_render_particles_full()
117 vertices2[9] = x + w; in cairo_dock_render_particles_full()
118 vertices2[11] = z; in cairo_dock_render_particles_full()
121 vertices2[1] = y + h; in cairo_dock_render_particles_full()
122 vertices2[4] = y - h; in cairo_dock_render_particles_full()
[all …]
|
| /dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/objMesh/ |
| H A D | objMeshOffsetVoxels.cpp | 447 map<gridPoint,int> vertices2; in surfaceOffsetMesh() local
564 map<gridPoint,int> vertices2; in generateCubicMesh() local
775 map<gridPoint,int> vertices2; in generateCubicMesh() local
854 if (iter != vertices2.end()) in generateCubicMesh()
975 map<gridPoint,int> vertices2; in generateInterpolationMasks() local
1036 if (voxelVertexEntry == vertices2.end()) in generateInterpolationMasks()
1044 if (voxelVertexEntry == vertices2.end()) in generateInterpolationMasks()
1052 if (voxelVertexEntry == vertices2.end()) in generateInterpolationMasks()
1060 if (voxelVertexEntry == vertices2.end()) in generateInterpolationMasks()
1068 if (voxelVertexEntry == vertices2.end()) in generateInterpolationMasks()
[all …]
|
| /dports/graphics/processing/processing-1.5.1/modes/java/examples/3D/Form/Toroid/ |
| H A D | Toroid.pde | 31 PVector vertices[], vertices2[];
67 vertices2 = new PVector[pts+1];
72 vertices2[i] = new PVector();
90 vertex(vertices2[j].x, vertices2[j].y, vertices2[j].z);
92 vertices2[j].x = cos(radians(latheAngle))*vertices[j].x;
93 vertices2[j].y = sin(radians(latheAngle))*vertices[j].x;
94 vertices2[j].z = vertices[j].z;
99 vertex(vertices2[j].x, vertices2[j].y, vertices2[j].z);
|
| /dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/traversal/distance/ |
| H A D | mesh_distance_traversal_node-inl.h | 99 vertices2 = nullptr; in MeshDistanceTraversalNode()
216 node.vertices2 = model2.vertices; in initialize()
240 this->vertices2, in preprocess()
272 this->vertices2, in leafTesting()
299 this->vertices2, in preprocess()
331 this->vertices2, in leafTesting()
358 this->vertices2, in preprocess()
390 this->vertices2, in leafTesting()
407 Vector3<typename BV::S>* vertices2, in meshDistanceOrientedNodeLeafTesting() argument
459 Vector3<typename BV::S>* vertices2, in meshDistanceOrientedNodeLeafTesting() argument
[all …]
|
| /dports/math/fcl05/fcl-0.5.0/src/traversal/ |
| H A D | traversal_node_bvhs.cpp | 73 const Vec3f& q1 = vertices2[tri_id2[0]]; in meshCollisionOrientedNodeLeafTesting()
74 const Vec3f& q2 = vertices2[tri_id2[1]]; in meshCollisionOrientedNodeLeafTesting()
75 const Vec3f& q3 = vertices2[tri_id2[2]]; in meshCollisionOrientedNodeLeafTesting()
163 const Vec3f& t21 = vertices2[tri_id2[0]]; in meshDistanceOrientedNodeLeafTesting()
164 const Vec3f& t22 = vertices2[tri_id2[1]]; in meshDistanceOrientedNodeLeafTesting()
165 const Vec3f& t23 = vertices2[tri_id2[2]]; in meshDistanceOrientedNodeLeafTesting()
318 init_tri2_points[0] = vertices2[init_tri2[0]]; in distancePreprocessOrientedNode()
319 init_tri2_points[1] = vertices2[init_tri2[1]]; in distancePreprocessOrientedNode()
543 const Vec3f& t21 = vertices2[tri_id2[0]]; in meshConservativeAdvancementOrientedNodeLeafTesting()
544 const Vec3f& t22 = vertices2[tri_id2[1]]; in meshConservativeAdvancementOrientedNodeLeafTesting()
[all …]
|
| /dports/devel/emscripten/emscripten-2.0.3/tests/ |
| H A D | gl_vertex_buffer.c | 111 Vertex vertices2[18] = { in main() local
140 …glBufferData(GL_ARRAY_BUFFER, sizeof(vertices2), vertices2, GL_STATIC_READ); // GL_STATIC_READ is … in main()
174 …, GL_UNSIGNED_BYTE, sizeof(Vertex), (GLvoid*)((GLvoid*)&vertices2[0].color - (GLvoid*)&vertices2[0… in main()
|
| H A D | gl_vertex_buffer_pre.c | 111 Vertex vertices2[18] = { in main() local
140 glBufferData(GL_ARRAY_BUFFER, sizeof(vertices2), vertices2, GL_STATIC_DRAW); in main()
|
| /dports/net/samba412/samba-4.12.15/python/samba/tests/kcc/ |
| H A D | graph_utils.py | 60 vertices2 = tuple('ijk')
62 edges2 = tuple(itertools.combinations(vertices2, 2))
67 tree2 = make_tree(vertices2)
72 vertices + vertices2,
73 vertices + vertices2]
76 vertices + vertices2,
84 vertices + vertices2,
85 vertices + vertices2]
|
| /dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/traversal/collision/ |
| H A D | mesh_collision_traversal_node-inl.h | 119 vertices2 = nullptr; in MeshCollisionTraversalNode()
268 node.vertices2 = model2.vertices; in initialize()
309 this->vertices2, in leafTesting()
362 this->vertices2, in leafTesting()
387 this->vertices2, in leafTesting()
428 this->vertices2, in leafTesting()
470 this->vertices2, in leafTesting()
512 this->vertices2, in leafTesting()
532 Vector3<typename BV::S>* vertices2, in meshCollisionOrientedNodeLeafTesting() argument
630 Vector3<typename BV::S>* vertices2, in meshCollisionOrientedNodeLeafTesting() argument
[all …]
|
| /dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/meshes3d/ |
| H A D | subdivideMesh.m | 28 function [vertices2, faces2] = subdivideMesh(vertices, faces, n)
98 vertices2 = vertices; variable
113 edgeNewVertexIndices(iEdge,:) = size(vertices2, 1) + (1:n-1);
114 vertices2 = [vertices2 ; newPoints]; %#ok<AGROW> variable
161 v1 = vertices2(ivr1, :);
162 v2 = vertices2(ivr2, :);
171 newInds = size(vertices2, 1) + (1:iStrip-1);
175 vertices2 = [vertices2 ; newPoints]; %#ok<AGROW> variable
|
| /dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/measure/tests/ |
| H A D | test_marching_cubes.py | 86 vertices2, faces2 = marching_cubes(sphere_small, 0,
94 assert _same_mesh(vertices1, faces1, vertices2, faces2)
98 def _same_mesh(vertices1, faces1, vertices2, faces2, tol=1e-10): argument
104 triangles2 = vertices2[np.array(faces2)]
137 vertices2, faces2 = marching_cubes(vol, 0)[:2]
141 assert not _same_mesh(vertices1, faces1, vertices2, faces2)
143 assert not _same_mesh(vertices2, faces2, vertices3, faces3)
|
| /dports/math/fcl05/fcl-0.5.0/include/fcl/traversal/ |
| H A D | traversal_node_bvhs.h | 151 vertices2 = NULL; in MeshCollisionTraversalNode()
173 const Vec3f& q1 = vertices2[tri_id2[0]]; in leafTesting()
174 const Vec3f& q2 = vertices2[tri_id2[1]]; in leafTesting()
175 const Vec3f& q3 = vertices2[tri_id2[2]]; in leafTesting()
240 Vec3f* vertices2; variable
335 vertices2 = NULL; in MeshContinuousCollisionTraversalNode()
374 T1[i] = vertices2 + tri_id2[i]; in leafTesting()
439 Vec3f* vertices2; variable
549 vertices2 = NULL; in MeshDistanceTraversalNode()
575 const Vec3f& t21 = vertices2[tri_id2[0]]; in leafTesting()
[all …]
|
| /dports/science/py-scimath/scimath-4.2.0/scimath/mathematics/ |
| H A D | quaternion.py | 116 def _crossv(vertices1, vertices2): argument
123 v20, v21, v22 = np.transpose(vertices2)
135 def _dotv(vertices1, vertices2): argument
141 return np.sum(vertices1 * vertices2, axis=-1)
|
| /dports/math/igraph/igraph-0.9.5/src/paths/ |
| H A D | unweighted.c | 508 igraph_vector_ptr_t vertices2, *vp = &vertices2; in igraph_get_shortest_path() local
512 IGRAPH_CHECK(igraph_vector_ptr_init(&vertices2, 1)); in igraph_get_shortest_path()
513 IGRAPH_FINALLY(igraph_vector_ptr_destroy, &vertices2); in igraph_get_shortest_path()
514 VECTOR(vertices2)[0] = vertices; in igraph_get_shortest_path() local
534 igraph_vector_ptr_destroy(&vertices2); in igraph_get_shortest_path()
|
| /dports/devel/upp/upp/uppsrc/plugin/box2d/ |
| H A D | b2CollidePolygon.cpp | 31 const b2Vec2* vertices2 = poly2->m_vertices; in b2EdgeSeparation() local
45 float32 dot = b2Dot(vertices2[i], normal1); in b2EdgeSeparation()
54 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in b2EdgeSeparation()
150 const b2Vec2* vertices2 = poly2->m_vertices; in b2FindIncidentEdge() local
175 c[0].v = b2Mul(xf2, vertices2[i1]); in b2FindIncidentEdge()
180 c[1].v = b2Mul(xf2, vertices2[i2]); in b2FindIncidentEdge()
|
| /dports/x11-wm/compiz-plugins-unsupported/compiz-plugins-unsupported-0.8.8/src/atlantis/ |
| H A D | water.c | 295 w->vertices2 = NULL; in genWater()
365 if (w->vertices2) in freeWater()
366 free (w->vertices2); in freeWater()
373 w->vertices2 = NULL; in freeWater()
680 free (w->vertices2); in deformSphere()
681 w->vertices2 = NULL; in deformSphere()
694 if (!w->vertices2) in deformSphere()
697 if (!w->vertices2) in deformSphere()
872 w->vertices2); in updateHeight()
1219 v = (float *) g->vertices2; in drawGround()
[all …]
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/geometry/euclidean/twod/ |
| H A D | PolygonsSetTest.java | 356 Vector2D[][] vertices2 = new Vector2D[][] { in testUnlimitedSubHyperplane() local
363 PolygonsSet set2 = buildSet(vertices2); in testUnlimitedSubHyperplane()
395 Vector2D[][] vertices2 = new Vector2D[][] { in testUnion() local
403 PolygonsSet set2 = buildSet(vertices2); in testUnion()
459 Vector2D[][] vertices2 = new Vector2D[][] { in testIntersection() local
467 PolygonsSet set2 = buildSet(vertices2); in testIntersection()
516 PolygonsSet set2 = buildSet(vertices2); in testXor()
587 PolygonsSet set2 = buildSet(vertices2); in testDifference()
650 PolygonsSet set2 = buildSet(vertices2); in testEmptyDifference()
717 PolygonsSet set2 = buildSet(vertices2); in testConcentric()
[all …]
|
| /dports/devel/juce/JUCE-f37e9a1/modules/juce_box2d/box2d/Collision/ |
| H A D | b2CollidePolygon.cpp | 30 const b2Vec2* vertices2 = poly2->m_vertices; in b2EdgeSeparation() local
44 float32 dot = b2Dot(vertices2[i], normal1); in b2EdgeSeparation()
53 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in b2EdgeSeparation()
148 const b2Vec2* vertices2 = poly2->m_vertices; in b2FindIncidentEdge() local
173 c[0].v = b2Mul(xf2, vertices2[i1]); in b2FindIncidentEdge()
179 c[1].v = b2Mul(xf2, vertices2[i2]); in b2FindIncidentEdge()
|
| /dports/devel/love07/love-HEAD/src/modules/physics/box2d/Source/Collision/ |
| H A D | b2CollidePoly.cpp | 71 const b2Vec2* vertices2 = poly2->GetVertices(); in EdgeSeparation() local
85 float32 dot = b2Dot(vertices2[i], normal1); in EdgeSeparation()
94 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in EdgeSeparation()
206 const b2Vec2* vertices2 = poly2->GetVertices(); in FindIncidentEdge() local
231 c[0].v = b2Mul(xf2, vertices2[i1]); in FindIncidentEdge()
236 c[1].v = b2Mul(xf2, vertices2[i2]); in FindIncidentEdge()
|
| /dports/devel/love5/love-0.5-0/src/box2d/Source/Collision/ |
| H A D | b2CollidePoly.cpp | 71 const b2Vec2* vertices2 = poly2->GetVertices(); in EdgeSeparation() local
85 float32 dot = b2Dot(vertices2[i], normal1); in EdgeSeparation()
94 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in EdgeSeparation()
206 const b2Vec2* vertices2 = poly2->GetVertices(); in FindIncidentEdge() local
231 c[0].v = b2Mul(xf2, vertices2[i1]); in FindIncidentEdge()
236 c[1].v = b2Mul(xf2, vertices2[i2]); in FindIncidentEdge()
|
| /dports/devel/love08/love-0.8.0/src/libraries/Box2D/Collision/ |
| H A D | b2CollidePolygon.cpp | 30 const b2Vec2* vertices2 = poly2->m_vertices; in b2EdgeSeparation() local
44 float32 dot = b2Dot(vertices2[i], normal1); in b2EdgeSeparation()
53 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in b2EdgeSeparation()
148 const b2Vec2* vertices2 = poly2->m_vertices; in b2FindIncidentEdge() local
173 c[0].v = b2Mul(xf2, vertices2[i1]); in b2FindIncidentEdge()
179 c[1].v = b2Mul(xf2, vertices2[i2]); in b2FindIncidentEdge()
|
| /dports/graphics/py-box2d-py/box2d-py-2.3.8/Box2D/Collision/ |
| H A D | b2CollidePolygon.cpp | 30 const b2Vec2* vertices2 = poly2->m_vertices; in b2EdgeSeparation() local
44 float32 dot = b2Dot(vertices2[i], normal1); in b2EdgeSeparation()
53 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in b2EdgeSeparation()
148 const b2Vec2* vertices2 = poly2->m_vertices; in b2FindIncidentEdge() local
173 c[0].v = b2Mul(xf2, vertices2[i1]); in b2FindIncidentEdge()
179 c[1].v = b2Mul(xf2, vertices2[i2]); in b2FindIncidentEdge()
|
| /dports/devel/emscripten/emscripten-2.0.3/tests/third_party/box2d/Box2D/Collision/ |
| H A D | b2CollidePolygon.cpp | 30 const b2Vec2* vertices2 = poly2->m_vertices; in b2EdgeSeparation() local
44 float32 dot = b2Dot(vertices2[i], normal1); in b2EdgeSeparation()
53 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in b2EdgeSeparation()
148 const b2Vec2* vertices2 = poly2->m_vertices; in b2FindIncidentEdge() local
173 c[0].v = b2Mul(xf2, vertices2[i1]); in b2FindIncidentEdge()
179 c[1].v = b2Mul(xf2, vertices2[i2]); in b2FindIncidentEdge()
|
| /dports/games/numptyphysics/numptyphysics/Box2D/Source/Collision/ |
| H A D | b2CollidePoly.cpp | 71 const b2Vec2* vertices2 = poly2->GetVertices(); in EdgeSeparation() local
85 float32 dot = b2Dot(vertices2[i], normal1); in EdgeSeparation()
94 b2Vec2 v2 = b2Mul(xf2, vertices2[index]); in EdgeSeparation()
206 const b2Vec2* vertices2 = poly2->GetVertices(); in FindIncidentEdge() local
231 c[0].v = b2Mul(xf2, vertices2[i1]); in FindIncidentEdge()
236 c[1].v = b2Mul(xf2, vertices2[i2]); in FindIncidentEdge()
|