| /dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/traversal/distance/ |
| H A D | mesh_distance_traversal_node-inl.h | 98 vertices1 = nullptr; in MeshDistanceTraversalNode()
215 node.vertices1 = model1.vertices; in initialize()
239 this->vertices1, in preprocess()
271 this->vertices1, in leafTesting()
298 this->vertices1, in preprocess()
330 this->vertices1, in leafTesting()
357 this->vertices1, in preprocess()
389 this->vertices1, in leafTesting()
406 Vector3<typename BV::S>* vertices1, in meshDistanceOrientedNodeLeafTesting() argument
458 Vector3<typename BV::S>* vertices1, in meshDistanceOrientedNodeLeafTesting() argument
[all …]
|
| H A D | mesh_distance_traversal_node.h | 69 Vector3<S>* vertices1; variable
225 Vector3<typename BV::S>* vertices1,
243 Vector3<typename BV::S>* vertices1,
258 const Vector3<typename BV::S>* vertices1,
274 const Vector3<typename BV::S>* vertices1,
|
| /dports/math/fcl05/fcl-0.5.0/src/traversal/ |
| H A D | traversal_node_bvhs.cpp | 70 const Vec3f& p1 = vertices1[tri_id1[0]]; in meshCollisionOrientedNodeLeafTesting()
71 const Vec3f& p2 = vertices1[tri_id1[1]]; in meshCollisionOrientedNodeLeafTesting()
72 const Vec3f& p3 = vertices1[tri_id1[2]]; in meshCollisionOrientedNodeLeafTesting()
159 const Vec3f& t11 = vertices1[tri_id1[0]]; in meshDistanceOrientedNodeLeafTesting()
160 const Vec3f& t12 = vertices1[tri_id1[1]]; in meshDistanceOrientedNodeLeafTesting()
161 const Vec3f& t13 = vertices1[tri_id1[2]]; in meshDistanceOrientedNodeLeafTesting()
314 init_tri1_points[0] = vertices1[init_tri1[0]]; in distancePreprocessOrientedNode()
315 init_tri1_points[1] = vertices1[init_tri1[1]]; in distancePreprocessOrientedNode()
539 const Vec3f& t11 = vertices1[tri_id1[0]]; in meshConservativeAdvancementOrientedNodeLeafTesting()
540 const Vec3f& t12 = vertices1[tri_id1[1]]; in meshConservativeAdvancementOrientedNodeLeafTesting()
[all …]
|
| /dports/graphics/jogamp-jogl/jogl/src/test/com/jogamp/opengl/test/junit/jogl/glsl/ |
| H A D | TestGLSLShaderState02NEWT.java | 169 …final GLArrayDataServer vertices1 = GLSLMiscHelper.createVertices(gl, st, 0, -1, GLSLMiscHelper.ve… in testShaderState01Validation() local
170 System.err.println("vertices1: " + vertices1); in testShaderState01Validation()
171 vertices1.enableBuffer(gl, false); in testShaderState01Validation()
198 …GLSLMiscHelper.displayVCArrays(drawable, gl, st, true, vertices1, colors1, true, 2, durationPerTes… in testShaderState01Validation()
294 …final GLArrayDataServer vertices1 = GLSLMiscHelper.createVertices(gl, st, 0, -1, GLSLMiscHelper.ve… in testShaderState01PerformanceDouble() local
295 vertices1.enableBuffer(gl, false); in testShaderState01PerformanceDouble()
324 GLSLMiscHelper.displayVCArrays(drawable, gl, st, true, vertices1, colors1, true, 2, 0); in testShaderState01PerformanceDouble()
327 GLSLMiscHelper.displayVCArrays(drawable, gl, st, true, vertices1, colors1, true, 2, 0); in testShaderState01PerformanceDouble()
336 GLSLMiscHelper.displayVCArraysNoChecks(drawable, gl, true, vertices1, colors1, true); in testShaderState01PerformanceDouble()
347 GLSLMiscHelper.displayVCArraysNoChecks(drawable, gl, true, vertices1, colors1, true); in testShaderState01PerformanceDouble()
[all …]
|
| H A D | TestGLSLShaderState01NEWT.java | 136 …final GLArrayDataServer vertices1 = GLSLMiscHelper.createVertices(gl, null, sp.program(), -1, GLSL… in test00NoShaderState_Validation() local
137 System.err.println("vertices1: " + vertices1); in test00NoShaderState_Validation()
138 vertices1.enableBuffer(gl, false); in test00NoShaderState_Validation()
139 GLSLMiscHelper.validateGLArrayDataServerState(gl, null, vertices1); in test00NoShaderState_Validation()
176 vertices1.destroy(gl); in test00NoShaderState_Validation()
256 …final GLArrayDataServer vertices1 = GLSLMiscHelper.createVertices(gl, st, 0, -1, GLSLMiscHelper.ve… in test01ShaderState_Validation() local
257 System.err.println("vertices1: " + vertices1); in test01ShaderState_Validation()
258 vertices1.enableBuffer(gl, false); in test01ShaderState_Validation()
259 GLSLMiscHelper.validateGLArrayDataServerState(gl, st, vertices1); in test01ShaderState_Validation()
437 …final GLArrayDataServer vertices1 = GLSLMiscHelper.createVertices(gl, st, 0, -1, GLSLMiscHelper.ve… in test04ShaderState_PerformanceDouble() local
[all …]
|
| /dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/traversal/collision/ |
| H A D | mesh_collision_traversal_node-inl.h | 118 vertices1 = nullptr; in MeshCollisionTraversalNode()
267 node.vertices1 = model1.vertices; in initialize()
308 this->vertices1, in leafTesting()
361 this->vertices1, in leafTesting()
386 this->vertices1, in leafTesting()
427 this->vertices1, in leafTesting()
469 this->vertices1, in leafTesting()
511 this->vertices1, in leafTesting()
531 Vector3<typename BV::S>* vertices1, in meshCollisionOrientedNodeLeafTesting() argument
629 Vector3<typename BV::S>* vertices1, in meshCollisionOrientedNodeLeafTesting() argument
[all …]
|
| /dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/measure/tests/ |
| H A D | test_marching_cubes.py | 85 vertices1, faces1 = marching_cubes(sphere_small, 0, method='_lorensen')[:2]
94 assert _same_mesh(vertices1, faces1, vertices2, faces2)
95 assert _same_mesh(vertices1, faces1, vertices3, faces3)
98 def _same_mesh(vertices1, faces1, vertices2, faces2, tol=1e-10): argument
103 triangles1 = vertices1[np.array(faces1)]
136 vertices1, faces1 = marching_cubes(vol, 0, method='_lorensen')[:2]
141 assert not _same_mesh(vertices1, faces1, vertices2, faces2)
|
| /dports/math/igraph/igraph-0.9.5/src/community/walktrap/ |
| H A D | walktrap_communities.cpp | 72 IGRAPH_THREAD_LOCAL int* Probabilities::vertices1 = 0; member in igraph::walktrap::Probabilities
104 vertices1[nb_vertices1++] = m; in Probabilities()
123 int v1 = vertices1[i]; in Probabilities()
133 int v1 = vertices1[i]; in Probabilities()
152 vertices2 = vertices1; in Probabilities()
153 vertices1 = tmp2; in Probabilities()
171 … P[vertices1[i]] = tmp_vector1[vertices1[i]] / sqrt(G->vertices[vertices1[i]].total_weight); in Probabilities()
281 P[vertices1[i]] = tmp_vector1[vertices1[i]]; in Probabilities()
288 vertices[i] = vertices1[i]; in Probabilities()
289 P[i] = tmp_vector1[vertices1[i]]; in Probabilities()
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | walktrap_communities.cpp | 72 IGRAPH_THREAD_LOCAL int* Probabilities::vertices1 = 0; member in igraph::walktrap::Probabilities
104 vertices1[nb_vertices1++] = m; in Probabilities()
123 int v1 = vertices1[i]; in Probabilities()
133 int v1 = vertices1[i]; in Probabilities()
152 vertices2 = vertices1; in Probabilities()
153 vertices1 = tmp2; in Probabilities()
171 … P[vertices1[i]] = tmp_vector1[vertices1[i]] / sqrt(G->vertices[vertices1[i]].total_weight); in Probabilities()
281 P[vertices1[i]] = tmp_vector1[vertices1[i]]; in Probabilities()
288 vertices[i] = vertices1[i]; in Probabilities()
289 P[i] = tmp_vector1[vertices1[i]]; in Probabilities()
[all …]
|
| /dports/math/fcl05/fcl-0.5.0/test/ |
| H A D | test_fcl_frontlist.cpp | 54 … const std::vector<Vec3f>& vertices1, const std::vector<Triangle>& triangles1,
61 … const std::vector<Vec3f>& vertices1, const std::vector<Triangle>& triangles1,
68 const std::vector<Vec3f>& vertices1, const std::vector<Triangle>& triangles1,
200 … const std::vector<Vec3f>& vertices1, const std::vector<Triangle>& triangles1, in collide_front_list_Test() argument
213 std::vector<Vec3f> vertices1_new(vertices1.size()); in collide_front_list_Test()
216 vertices1_new[i] = tf1.transform(vertices1[i]); in collide_front_list_Test()
244 for(std::size_t i = 0; i < vertices1.size(); ++i) in collide_front_list_Test()
246 vertices1_new[i] = tf2.transform(vertices1[i]); in collide_front_list_Test()
283 m1.addSubModel(vertices1, triangles1); in collide_front_list_Test_Oriented()
323 const std::vector<Vec3f>& vertices1, const std::vector<Triangle>& triangles1, in collide_Test() argument
[all …]
|
| /dports/math/fcl05/fcl-0.5.0/include/fcl/traversal/ |
| H A D | traversal_node_bvhs.h | 150 vertices1 = NULL; in MeshCollisionTraversalNode()
170 const Vec3f& p1 = vertices1[tri_id1[0]]; in leafTesting()
171 const Vec3f& p2 = vertices1[tri_id1[1]]; in leafTesting()
172 const Vec3f& p3 = vertices1[tri_id1[2]]; in leafTesting()
239 Vec3f* vertices1; variable
334 vertices1 = NULL; in MeshContinuousCollisionTraversalNode()
372 S1[i] = vertices1 + tri_id1[i]; in leafTesting()
438 Vec3f* vertices1; variable
548 vertices1 = NULL; in MeshDistanceTraversalNode()
571 const Vec3f& t11 = vertices1[tri_id1[0]]; in leafTesting()
[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 | 347 Vector2D[][] vertices1 = new Vector2D[][] { in testUnlimitedSubHyperplane() local
355 PolygonsSet set1 = buildSet(vertices1); in testUnlimitedSubHyperplane()
386 Vector2D[][] vertices1 = new Vector2D[][] { in testUnion() local
394 PolygonsSet set1 = buildSet(vertices1); in testUnion()
458 PolygonsSet set1 = buildSet(vertices1); in testIntersection()
507 PolygonsSet set1 = buildSet(vertices1); in testXor()
578 PolygonsSet set1 = buildSet(vertices1); in testDifference()
641 PolygonsSet set1 = buildSet(vertices1); in testEmptyDifference()
705 PolygonsSet set1 = buildSet(vertices1); in testConcentric()
908 Vector2D[] vertices1 = new Vector2D[] { in testIssue880Simplified() local
[all …]
|
| /dports/science/py-scimath/scimath-4.2.0/scimath/mathematics/ |
| H A D | quaternion.py | 116 def _crossv(vertices1, vertices2): argument
122 v10, v11, v12 = np.transpose(vertices1)
135 def _dotv(vertices1, vertices2): argument
141 return np.sum(vertices1 * vertices2, axis=-1)
|
| /dports/cad/py-ezdxf/ezdxf-0.16.3/integration_tests/ |
| H A D | test_all_ellipse_transformations.py | 80 ellipse1, vertices1 = synced_scaling(ellipse0, vertices0, sx, sy,
82 assert check(ellipse1, vertices1, vertex_count) is True, config
105 ellipse1, vertices1 = synced_scaling(ellipse0, vertices0, sx, sy, sz)
106 assert check(ellipse1, vertices1, count) is True
|
| /dports/math/fcl/fcl-0.7.0/test/ |
| H A D | test_fcl_frontlist.cpp | 49 … const std::vector<Vector3<typename BV::S>>& vertices1, const std::vector<Triangle>& triangles1,
56 … const std::vector<Vector3<typename BV::S>>& vertices1, const std::vector<Triangle>& triangles1,
63 … const std::vector<Vector3<typename BV::S>>& vertices1, const std::vector<Triangle>& triangles1,
206 … const std::vector<Vector3<typename BV::S>>& vertices1, const std::vector<Triangle>& triangles1, in collide_front_list_Test() argument
221 std::vector<Vector3<S>> vertices1_new(vertices1.size()); in collide_front_list_Test()
224 vertices1_new[i] = tf1 * vertices1[i]; in collide_front_list_Test()
253 for(std::size_t i = 0; i < vertices1.size(); ++i) in collide_front_list_Test()
255 vertices1_new[i] = tf2 * vertices1[i]; in collide_front_list_Test()
294 m1.addSubModel(vertices1, triangles1); in collide_front_list_Test_Oriented()
335 … const std::vector<Vector3<typename BV::S>>& vertices1, const std::vector<Triangle>& triangles1, in collide_Test() argument
[all …]
|
| /dports/devel/upp/upp/uppsrc/plugin/box2d/ |
| H A D | b2CollidePolygon.cpp | 27 const b2Vec2* vertices1 = poly1->m_vertices; in b2EdgeSeparation() local
53 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in b2EdgeSeparation()
243 const b2Vec2* vertices1 = poly1->m_vertices; in b2CollidePolygons() local
245 b2Vec2 v11 = vertices1[edge1]; in b2CollidePolygons()
246 b2Vec2 v12 = edge1 + 1 < count1 ? vertices1[edge1+1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/devel/love07/love-HEAD/src/modules/physics/box2d/Source/Collision/ |
| H A D | b2CollidePoly.cpp | 67 const b2Vec2* vertices1 = poly1->GetVertices(); in EdgeSeparation() local
93 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
297 const b2Vec2* vertices1 = poly1->GetVertices(); in b2CollidePolygons() local
299 b2Vec2 v11 = vertices1[edge1]; in b2CollidePolygons()
300 b2Vec2 v12 = edge1 + 1 < count1 ? vertices1[edge1+1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/devel/love5/love-0.5-0/src/box2d/Source/Collision/ |
| H A D | b2CollidePoly.cpp | 67 const b2Vec2* vertices1 = poly1->GetVertices(); in EdgeSeparation() local
93 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
297 const b2Vec2* vertices1 = poly1->GetVertices(); in b2CollidePolygons() local
299 b2Vec2 v11 = vertices1[edge1]; in b2CollidePolygons()
300 b2Vec2 v12 = edge1 + 1 < count1 ? vertices1[edge1+1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/games/numptyphysics/numptyphysics/Box2D/Source/Collision/ |
| H A D | b2CollidePoly.cpp | 67 const b2Vec2* vertices1 = poly1->GetVertices(); in EdgeSeparation() local
93 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
297 const b2Vec2* vertices1 = poly1->GetVertices(); in b2CollidePolygons() local
299 b2Vec2 v11 = vertices1[edge1]; in b2CollidePolygons()
300 b2Vec2 v12 = edge1 + 1 < count1 ? vertices1[edge1+1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/Mesh/ |
| H A D | MeshUtil.cpp | 145 std::vector<Mesh::VertexHandle> vertices1; in meshes_are_different() local
150 mesh1.get_all_vertices(vertices1, err); MSQ_ERRZERO(err); in meshes_are_different()
171 if (vertices1.size() != vertices2.size()) MDRET("vertices sizes differ"); in meshes_are_different()
180 for (unsigned i=0; i < vertices1.size(); i++) in meshes_are_different()
183 mesh1.vertices_get_coordinates( &vertices1[i], &vert1, 1, err ); MSQ_ERRZERO(err); in meshes_are_different()
|
| /dports/devel/bullet/bullet3-3.21/src/BulletCollision/CollisionDispatch/ |
| H A D | btBox2dBox2dCollisionAlgorithm.cpp | 132 const btVector3* vertices1 = poly1->getVertices(); in EdgeSeparation() local
151 btVector3 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
345 const btVector3* vertices1 = poly1->getVertices(); in b2CollidePolygons() local
347 btVector3 v11 = vertices1[edge1]; in b2CollidePolygons()
348 btVector3 v12 = edge1 + 1 < count1 ? vertices1[edge1 + 1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/graphics/blender/blender-2.91.0/extern/bullet2/src/BulletCollision/CollisionDispatch/ |
| H A D | btBox2dBox2dCollisionAlgorithm.cpp | 132 const btVector3* vertices1 = poly1->getVertices(); in EdgeSeparation() local
151 btVector3 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
345 const btVector3* vertices1 = poly1->getVertices(); in b2CollidePolygons() local
347 btVector3 v11 = vertices1[edge1]; in b2CollidePolygons()
348 btVector3 v12 = edge1 + 1 < count1 ? vertices1[edge1 + 1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/BulletCollision/CollisionDispatch/ |
| H A D | btBox2dBox2dCollisionAlgorithm.cpp | 138 const btVector3* vertices1 = poly1->getVertices(); in EdgeSeparation() local
164 btVector3 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
366 const btVector3* vertices1 = poly1->getVertices(); in b2CollidePolygons() local
368 btVector3 v11 = vertices1[edge1]; in b2CollidePolygons()
369 btVector3 v12 = edge1 + 1 < count1 ? vertices1[edge1+1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/games/critterding/critterding-beta12/src/utils/bullet/BulletCollision/CollisionDispatch/ |
| H A D | btBox2dBox2dCollisionAlgorithm.cpp | 138 const btVector3* vertices1 = poly1->getVertices(); in EdgeSeparation() local
164 btVector3 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
366 const btVector3* vertices1 = poly1->getVertices(); in b2CollidePolygons() local
368 btVector3 v11 = vertices1[edge1]; in b2CollidePolygons()
369 btVector3 v12 = edge1 + 1 < count1 ? vertices1[edge1+1] : vertices1[0]; in b2CollidePolygons()
|
| /dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/BulletCollision/CollisionDispatch/ |
| H A D | btBox2dBox2dCollisionAlgorithm.cpp | 132 const btVector3* vertices1 = poly1->getVertices(); in EdgeSeparation() local
151 btVector3 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation()
345 const btVector3* vertices1 = poly1->getVertices(); in b2CollidePolygons() local
347 btVector3 v11 = vertices1[edge1]; in b2CollidePolygons()
348 btVector3 v12 = edge1 + 1 < count1 ? vertices1[edge1 + 1] : vertices1[0]; in b2CollidePolygons()
|