HomeSort by relevance Sort by last modified time
    Searched defs:poly2 (Results 1 - 3 of 3) sorted by null

  /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/box2d/
ApplyForce.java 103 PolygonShape poly2 = new PolygonShape(); local
104 poly2.set(vertices);
107 sd2.shape = poly2;
122 poly2.dispose();
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
b2CollidePolygon.cpp 22 // Find the max separation between poly1 and poly2 using edge normals from poly1.
25 const b2PolygonShape* poly2, const b2Transform& xf2)
28 int32 count2 = poly2->m_count;
31 const b2Vec2* v2s = poly2->m_vertices;
66 const b2PolygonShape* poly2, const b2Transform& xf2)
70 int32 count2 = poly2->m_count;
71 const b2Vec2* vertices2 = poly2->m_vertices;
72 const b2Vec2* normals2 = poly2->m_normals;
76 // Get the normal of the reference edge in poly2's frame.
79 // Find the incident edge on poly2
134 const b2PolygonShape* poly2; \/\/ incident polygon local
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
btBox2dBox2dCollisionAlgorithm.cpp 134 // Find the separation between poly1 and poly2 for a give edge normal on poly1.
136 const btBox2dShape* poly2, const btTransform& xf2)
141 int count2 = poly2->getVertexCount();
142 const btVector3* vertices2 = poly2->getVertices();
146 // Convert normal from poly1's frame into poly2's frame.
150 // Find support vertex on poly2 for -normal.
163 // Find the max separation between poly1 and poly2 using edge normals from poly1.
166 const btBox2dShape* poly2, const btTransform& xf2)
171 // Vector pointing from the centroid of poly1 to the centroid of poly2.
172 btVector3 d = b2Mul(xf2, poly2->getCentroid()) - b2Mul(xf1, poly1->getCentroid())
321 const btBox2dShape* poly2; \/\/ incident poly local
    [all...]

Completed in 1113 milliseconds