HomeSort by relevance Sort by last modified time
    Searched refs:m_vertices (Results 1 - 25 of 50) sorted by null

1 2

  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/
btTetrahedronShape.cpp 71 btVector3 worldVertex = t(m_vertices[i]);
84 m_vertices[m_numVertices++] = pt;
120 pa = m_vertices[0];
121 pb = m_vertices[1];
127 pa = m_vertices[0];
128 pb = m_vertices[1];
131 pa = m_vertices[1];
132 pb = m_vertices[2];
135 pa = m_vertices[2];
136 pb = m_vertices[0]
    [all...]
btShapeHull.h 32 btAlignedObjectArray<btVector3> m_vertices; variable
53 return &m_vertices[0];
btConvexPolyhedron.h 46 btAlignedObjectArray<btVector3> m_vertices; variable
btShapeHull.cpp 27 m_vertices.clear ();
35 m_vertices.clear ();
82 m_vertices.resize (static_cast<int>(hr.mNumOutputVertices));
87 m_vertices[i] = hr.m_OutputVertices[i];
111 return m_vertices.size ();
btConvexPolyhedron.cpp 118 btVector3 edge = m_vertices[vp.m_v1]-m_vertices[vp.m_v0];
179 const btVector3& p0 = m_vertices[m_faces[i].m_indices[0]];
183 const btVector3& p1 = m_vertices[m_faces[i].m_indices[j]];
184 const btVector3& p2 = m_vertices[m_faces[i].m_indices[k]];
215 for(int i=0; i<m_vertices.size(); i++)
217 const btVector3& pt = m_vertices[i];
281 int numVerts = m_vertices.size();
284 btVector3 pt = trans * m_vertices[i];
btTetrahedronShape.h 30 btVector3 m_vertices[4]; variable
btBox2dShape.h 32 btVector3 m_vertices[4]; variable
93 m_vertices[0].setValue(-boxHalfExtents.getX(),-boxHalfExtents.getY(),0);
94 m_vertices[1].setValue(boxHalfExtents.getX(),-boxHalfExtents.getY(),0);
95 m_vertices[2].setValue(boxHalfExtents.getX(),boxHalfExtents.getY(),0);
96 m_vertices[3].setValue(-boxHalfExtents.getX(),boxHalfExtents.getY(),0);
158 return &m_vertices[0];
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/
gim_tri_collision.h 129 btVector3 m_vertices[3]; member in class:GIM_TRIANGLE
137 return GIM_AABB(m_vertices[0],m_vertices[1],m_vertices[2],m_margin);
142 TRIANGLE_NORMAL(m_vertices[0],m_vertices[1],m_vertices[2],normal);
147 TRIANGLE_PLANE(m_vertices[0],m_vertices[1],m_vertices[2],plane);
    [all...]
btTriangleShapeEx.h 77 btVector3 m_vertices[3]; member in class:btPrimitiveTriangle
89 btVector3 normal = (m_vertices[1]-m_vertices[0]).cross(m_vertices[2]-m_vertices[0]);
91 m_plane.setValue(normal[0],normal[1],normal[2],m_vertices[0].dot(normal));
103 const btVector3 & e0 = m_vertices[edge_index];
104 const btVector3 & e1 = m_vertices[(edge_index+1)%3];
110 m_vertices[0] = t(m_vertices[0])
    [all...]
btTriangleShapeEx.cpp 69 btScalar dis0 = bt_distance_point_plane(m_plane,other.m_vertices[0]) - total_margin;
71 btScalar dis1 = bt_distance_point_plane(m_plane,other.m_vertices[1]) - total_margin;
73 btScalar dis2 = bt_distance_point_plane(m_plane,other.m_vertices[2]) - total_margin;
78 dis0 = bt_distance_point_plane(other.m_plane,m_vertices[0]) - total_margin;
80 dis1 = bt_distance_point_plane(other.m_plane,m_vertices[1]) - total_margin;
82 dis2 = bt_distance_point_plane(other.m_plane,m_vertices[2]) - total_margin;
102 edgeplane,other.m_vertices[0],other.m_vertices[1],other.m_vertices[2],temp_points);
gim_box_set.h 499 m_tri0.m_vertices[0] = trans_cache_0to1(m_tri0.m_vertices[0]);
500 m_tri0.m_vertices[1] = trans_cache_0to1(m_tri0.m_vertices[1]);
501 m_tri0.m_vertices[2] = trans_cache_0to1(m_tri0.m_vertices[2]);
512 m_tri1.m_vertices[0] = trans_cache_1to0.transform(m_tri1.m_vertices[0]);
513 m_tri1.m_vertices[1] = trans_cache_1to0.transform(m_tri1.m_vertices[1])
    [all...]
gim_tri_collision.cpp 632 m_vertices[0],m_vertices[1],m_vertices[2],m_margin,
633 other.m_vertices[0],other.m_vertices[1],other.m_vertices[2],other.m_margin,
btGImpactShape.h 69 m_vertices[0] = v0;
70 m_vertices[1] = v1;
71 m_vertices[2] = v2;
72 m_vertices[3] = v3;
689 triangle.m_vertices[0],
690 triangle.m_vertices[1],triangle.m_vertices[2],triangle.m_margin);
697 get_vertex(indices[0],triangle.m_vertices[0]);
698 get_vertex(indices[1],triangle.m_vertices[1]);
699 get_vertex(indices[2],triangle.m_vertices[2])
    [all...]
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/Shapes/
b2ChainShape.cpp 32 b2Free(m_vertices);
33 m_vertices = NULL;
39 b2Assert(m_vertices == NULL && m_count == 0);
50 m_vertices = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));
51 memcpy(m_vertices, vertices, count * sizeof(b2Vec2));
52 m_vertices[count] = m_vertices[0];
53 m_prevVertex = m_vertices[m_count - 2];
54 m_nextVertex = m_vertices[1];
61 b2Assert(m_vertices == NULL && m_count == 0)
    [all...]
b2ChainShape.h 92 return m_vertices[index];
96 const b2Vec2* GetVertices() const { return m_vertices; }
99 b2Vec2* m_vertices; member in class:b2ChainShape
112 m_vertices = NULL;
b2PolygonShape.cpp 33 m_vertices[0].Set(-hx, -hy);
34 m_vertices[1].Set( hx, -hy);
35 m_vertices[2].Set( hx, hy);
36 m_vertices[3].Set(-hx, hy);
47 m_vertices[0].Set(-hx, -hy);
48 m_vertices[1].Set( hx, -hy);
49 m_vertices[2].Set( hx, hy);
50 m_vertices[3].Set(-hx, hy);
64 m_vertices[i] = b2Mul(xf, m_vertices[i])
    [all...]
b2PolygonShape.h 82 b2Vec2 m_vertices[b2_maxPolygonVertices]; member in class:b2PolygonShape
98 return m_vertices[index];
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
b2Distance.h 31 b2DistanceProxy() : m_vertices(NULL), m_count(0), m_radius(0.0f) {}
50 const b2Vec2* m_vertices; member in struct:b2DistanceProxy
104 return m_vertices[index];
110 float32 bestValue = b2Dot(m_vertices[0], d);
113 float32 value = b2Dot(m_vertices[i], d);
127 float32 bestValue = b2Dot(m_vertices[0], d);
130 float32 value = b2Dot(m_vertices[i], d);
138 return m_vertices[bestIndex];
b2Distance.cpp 35 m_vertices = &circle->m_p;
44 m_vertices = polygon->m_vertices;
55 m_buffer[0] = chain->m_vertices[index];
58 m_buffer[1] = chain->m_vertices[index + 1];
62 m_buffer[1] = chain->m_vertices[0];
65 m_vertices = m_buffer;
74 m_vertices = &edge->m_vertex1;
b2CollidePolygon.cpp 30 const b2Vec2* v1s = poly1->m_vertices;
31 const b2Vec2* v2s = poly2->m_vertices;
71 const b2Vec2* vertices2 = poly2->m_vertices;
165 const b2Vec2* vertices1 = poly1->m_vertices;
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/shapes/
ChainShape.java 46 public Vec2[] m_vertices; field in class:ChainShape
55 m_vertices = null;
72 final Vec2 v0 = m_vertices[index + 0];
73 final Vec2 v1 = m_vertices[index + 1];
80 Vec2 v = m_vertices[index - 1];
91 Vec2 v = m_vertices[index + 2];
125 Vec2 v = m_vertices[i1];
128 Vec2 v1 = m_vertices[i2];
147 final Vec2 vi1 = m_vertices[i1];
148 final Vec2 vi2 = m_vertices[i2]
    [all...]
PolygonShape.java 51 * The vertices of the shape. Note: use getVertexCount(), not m_vertices.length, to get number of
54 public final Vec2 m_vertices[]; field in class:PolygonShape
78 m_vertices = new Vec2[Settings.maxPolygonVertices];
79 for (int i = 0; i < m_vertices.length; i++) {
80 m_vertices[i] = new Vec2();
95 shape.m_vertices[i].set(m_vertices[i]);
215 if (m_vertices[i] == null) {
216 m_vertices[i] = new Vec2();
218 m_vertices[i].set(ps[hull[i]])
    [all...]
  /external/deqp/modules/glshared/
glsRandomShaderCase.hpp 50 const std::vector<float>& getVertices (void) const { return m_vertices; }
51 std::vector<float>& getVertices (void) { return m_vertices; }
58 std::vector<float> m_vertices; member in class:deqp::gls::VertexArray
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/
Distance.java 472 * just do assignments with m_vertices, instead of copying stuff over
477 public final Vec2[] m_vertices; field in class:Distance.DistanceProxy
483 m_vertices = new Vec2[Settings.maxPolygonVertices];
484 for (int i = 0; i < m_vertices.length; i++) {
485 m_vertices[i] = new Vec2();
500 m_vertices[0].set(circle.m_p);
510 m_vertices[i].set(poly.m_vertices[i]);
517 m_buffer[0] = chain.m_vertices[index];
519 m_buffer[1] = chain.m_vertices[index + 1]
    [all...]
  /external/deqp/external/vulkancts/modules/vulkan/api/
vktApiBufferViewAccessTests.cpp 98 std::vector<tcu::Vec4> m_vertices; member in class:vkt::api::__anon8857::BufferViewTestInstance
127 m_vertices.push_back(a);
128 m_vertices.push_back(c);
129 m_vertices.push_back(b);
132 m_vertices.push_back(c);
133 m_vertices.push_back(a);
134 m_vertices.push_back(d);
597 const VkDeviceSize vertexDataSize = m_vertices.size() * sizeof(tcu::Vec4);
616 deMemcpy(m_vertexBufferAlloc->getHostPtr(), m_vertices.data(), (size_t)vertexDataSize);
706 vk.cmdDraw(*m_cmdBuffer, (deUint32)m_vertices.size(), 1, 0, 0)
    [all...]

Completed in 683 milliseconds

1 2