Searched refs:triangles (Results 1 - 15 of 15) sorted by relevance

/external/jmonkeyengine/engine/src/bullet-native/
H A Dcom_jme3_bullet_util_NativeMeshUtil.cpp51 int* triangles = (int*) env->GetDirectBufferAddress(triangleIndexBase); local
53 btTriangleIndexVertexArray* array = new btTriangleIndexVertexArray(numTriangles, triangles, triangleIndexStride, numVertices, vertices, vertexStride);
/external/jmonkeyengine/engine/src/core/com/jme3/util/
H A DTangentBinormalGenerator.java81 public final ArrayList<TriangleData> triangles = new ArrayList<TriangleData>(); field in class:TangentBinormalGenerator.VertexData
203 vertices[index[0]].triangles.add(triData);
204 vertices[index[1]].triangles.add(triData);
205 vertices[index[2]].triangles.add(triData);
238 vertices[index[0]].triangles.add(triData);
239 vertices[index[1]].triangles.add(triData);
240 vertices[index[2]].triangles.add(triData);
284 vertices[index[0]].triangles.add(triData);
285 vertices[index[1]].triangles.add(triData);
286 vertices[index[2]].triangles
[all...]
/external/deqp/modules/glshared/
H A DglsRasterizationTestUtil.cpp587 calcTriangleInterpolationWeights(scene.triangles[primitiveNdx].positions[0], scene.triangles[primitiveNdx].positions[1], scene.triangles[primitiveNdx].positions[2], corners[0]),
588 calcTriangleInterpolationWeights(scene.triangles[primitiveNdx].positions[0], scene.triangles[primitiveNdx].positions[1], scene.triangles[primitiveNdx].positions[2], corners[1]),
589 calcTriangleInterpolationWeights(scene.triangles[primitiveNdx].positions[0], scene.triangles[primitiveNdx].positions[1], scene.triangles[primitiveNdx].positions[2], corners[2]),
590 calcTriangleInterpolationWeights(scene.triangles[primitiveNd
[all...]
H A DglsRasterizationTestUtil.hpp72 std::vector<SceneTriangle> triangles; member in struct:deqp::gls::RasterizationTestUtil::TriangleSceneSpec
/external/deqp/modules/gles2/functional/
H A Des2fShaderInvarianceTests.cpp208 std::vector<tcu::Vec4> triangles (numTriangles * 3 * 2);
216 const tcu::Vec4 vertex3 = vertex2 + genRandomVector(rnd) * 0.01f; // generate narrow triangles
218 triangles[triNdx*3 + 0] = vertex1;
219 triangles[triNdx*3 + 1] = vertex2;
220 triangles[triNdx*3 + 2] = vertex3;
226 triangles[(numTriangles + triNdx)*3 + 0] = genRandomVector(rnd);
227 triangles[(numTriangles + triNdx)*3 + 1] = genRandomVector(rnd);
228 triangles[(numTriangles + triNdx)*3 + 2] = genRandomVector(rnd);
234 gl.bufferData(GL_ARRAY_BUFFER, (int)(triangles.size() * sizeof(tcu::Vec4)), &triangles[
[all...]
H A Des2fPolygonOffsetTests.cpp1078 const tcu::Vec4 triangles[2][3] = local
1098 for (size_t ndx = 0; ndx < DE_LENGTH_OF_ARRAY(triangles[0]); ++ndx)
1100 << "\tx=" << triangles[0][ndx].x()
1101 << "\ty=" << triangles[0][ndx].y()
1102 << "\tz=" << triangles[0][ndx].z()
1103 << "\tw=" << triangles[0][ndx].w()
1106 for (size_t ndx = 0; ndx < DE_LENGTH_OF_ARRAY(triangles[1]); ++ndx)
1108 << "\tx=" << triangles[1][ndx].x()
1109 << "\ty=" << triangles[1][ndx].y()
1110 << "\tz=" << triangles[
[all...]
H A Des2fRasterizationTests.cpp252 std::vector<TriangleSceneSpec::SceneTriangle> triangles; local
254 generateTriangles(m_iteration, drawBuffer, triangles);
271 scene.triangles.swap(triangles);
1011 m_testCtx.getLog() << tcu::TestLog::Message << "Drawing gray triangles with shared edges.\nEnabling additive blending to detect overlapping fragments." << tcu::TestLog::EndMessage;
1253 std::vector<TriangleSceneSpec::SceneTriangle> triangles;
1257 extractTriangles(triangles, drawBuffer);
1285 scene.triangles.swap(triangles);
1314 // No triangles
[all...]
/external/deqp/modules/gles3/functional/
H A Des3fShaderInvarianceTests.cpp208 std::vector<tcu::Vec4> triangles (numTriangles * 3 * 2);
216 const tcu::Vec4 vertex3 = vertex2 + genRandomVector(rnd) * 0.01f; // generate narrow triangles
218 triangles[triNdx*3 + 0] = vertex1;
219 triangles[triNdx*3 + 1] = vertex2;
220 triangles[triNdx*3 + 2] = vertex3;
226 triangles[(numTriangles + triNdx)*3 + 0] = genRandomVector(rnd);
227 triangles[(numTriangles + triNdx)*3 + 1] = genRandomVector(rnd);
228 triangles[(numTriangles + triNdx)*3 + 2] = genRandomVector(rnd);
234 gl.bufferData(GL_ARRAY_BUFFER, (int)(triangles.size() * sizeof(tcu::Vec4)), &triangles[
[all...]
H A Des3fPolygonOffsetTests.cpp1081 const tcu::Vec4 triangles[2][3] = local
1101 for (size_t ndx = 0; ndx < DE_LENGTH_OF_ARRAY(triangles[0]); ++ndx)
1103 << "\tx=" << triangles[0][ndx].x()
1104 << "\ty=" << triangles[0][ndx].y()
1105 << "\tz=" << triangles[0][ndx].z()
1106 << "\tw=" << triangles[0][ndx].w()
1109 for (size_t ndx = 0; ndx < DE_LENGTH_OF_ARRAY(triangles[1]); ++ndx)
1111 << "\tx=" << triangles[1][ndx].x()
1112 << "\ty=" << triangles[1][ndx].y()
1113 << "\tz=" << triangles[
[all...]
H A Des3fRasterizationTests.cpp454 std::vector<TriangleSceneSpec::SceneTriangle> triangles;
456 generateTriangles(m_iteration, drawBuffer, triangles);
473 scene.triangles.swap(triangles);
1288 m_testCtx.getLog() << tcu::TestLog::Message << "Drawing gray triangles with shared edges.\nEnabling additive blending to detect overlapping fragments." << tcu::TestLog::EndMessage;
1530 std::vector<TriangleSceneSpec::SceneTriangle> triangles;
1534 extractTriangles(triangles, drawBuffer);
1562 scene.triangles.swap(triangles);
1591 // No triangles
[all...]
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/
H A DLODGeomap.java178 // add degenerate triangles
381 // add degenerate triangles
952 * Get the two triangles that make up the grid section at the specified point,
959 * @return two triangles in world space not local space
975 * Get the two triangles that make up the grid section at the specified point.
977 * For every grid space there are two triangles oriented like this:
982 * The corners of the mesh have differently oriented triangles. The two
1077 Triangle[] triangles = getGridTrianglesAtPoint(x, z);
1078 if (triangles == null) {
1083 Vector2f t1 = new Vector2f(triangles[
[all...]
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11gears/
H A Dd3d11gears.cpp103 printf("Creating gear with %i teeth using %i vertices used in %i triangles\n", teeth, num_vertices, num_triangles);
243 int triangles; member in struct:d3d11gears
275 triangles = 3200;
487 triangles = atoi(*++p);
516 gears[0].mesh = build_gear(dev, triangles / 2, 1.0f, 4.0f, 1.0f, 20, 0.7f);
517 gears[1].mesh = build_gear(dev, triangles / 4, 0.5f, 2.0f, 2.0f, 10, 0.7f);
518 gears[2].mesh = build_gear(dev, triangles / 4, 1.3f, 2.0f, 0.5f, 10, 0.7f);
/external/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe_validate.c51 static boolean triangles( unsigned prim ) function
79 /* Don't have to worry about triangles turning into lines/points
119 if (triangles(prim))
233 precalc_flat = TRUE; /* only needed for triangles really */
259 * This can actually be a win as culling out the triangles can lead
/external/deqp/modules/gles31/functional/
H A Des31fTextureMultisampleTests.cpp512 // Triangles are offset from the pixel center by "offset". Move the triangles back to take this into account.
527 scene.triangles.push_back(triangle);
H A Des31fTessellationTests.cpp440 case TESSPRIMITIVETYPE_TRIANGLES: return "triangles";
1454 //! Compare triangle sets, ignoring triangle order and vertex order within triangle, and possibly exclude some triangles too.
1477 TriangleSet& triangles = aOrB == 0 ? trianglesA : trianglesB;
1488 triangles.insert(triangle);
1732 // triangles/quads share a vertex, it's at the same index for everyone.
1805 << (m_primitiveType == TESSPRIMITIVETYPE_TRIANGLES ? "triangles" : m_primitiveType == TESSPRIMITIVETYPE_QUADS ? "quads" : DE_NULL)
3469 * order; rule #5 only requires that the same triangles are output, but
4646 * Test that the set of triangles input to the TES only depends on the
4648 * winding doesn't change the set of triangles, though it can change the
4671 * Test that the set of inner triangles inpu
[all...]

Completed in 432 milliseconds