/external/libgdx/gdx/src/com/badlogic/gdx/graphics/g2d/ |
PolygonRegion.java | 26 final short[] triangles;
field in class:PolygonRegion 33 public PolygonRegion (TextureRegion region, float[] vertices, short[] triangles) {
36 this.triangles = triangles;
57 return triangles;
|
PolygonSpriteBatch.java | 64 private final short[] triangles;
field in class:PolygonSpriteBatch 91 /** The maximum number of triangles rendered in one batch so far. **/
112 * @param size The max number of vertices and number of triangles in a single batch. Max of 10920.
117 if (size > 10920) throw new IllegalArgumentException("Can't have more than 10920 triangles per batch: " + size);
129 triangles = new short[size * 3];
208 final short[] triangles = this.triangles;
local 209 final short[] regionTriangles = region.triangles;
217 else if (triangleIndex + regionTrianglesLength > triangles.length
225 triangles[triangleIndex++] = (short)(regionTriangles[i] + startVertex); 246 final short[] triangles = this.triangles; local 291 final short[] triangles = this.triangles; local 342 final short[] triangles = this.triangles; local 367 final short[] triangles = this.triangles; local 509 final short[] triangles = this.triangles; local 578 final short[] triangles = this.triangles; local 635 final short[] triangles = this.triangles; local 693 final short[] triangles = this.triangles; local 750 final short[] triangles = this.triangles; local 785 final short[] triangles = this.triangles; local 844 final short[] triangles = this.triangles; local 975 final short[] triangles = this.triangles; local 1121 final short[] triangles = this.triangles; local [all...] |
/external/libgdx/gdx/src/com/badlogic/gdx/math/ |
DelaunayTriangulator.java | 34 private final ShortArray triangles = new ShortArray(false, 16);
field in class:DelaunayTriangulator 56 * @return triples of indices into the points that describe the triangles in clockwise order. Note the returned array is reused
59 ShortArray triangles = this.triangles;
local 60 triangles.clear();
61 if (count < 6) return triangles;
62 triangles.ensureCapacity(count);
107 triangles.add(end);
108 triangles.add(end + 2);
109 triangles.add(end + 4); [all...] |
EarClippingTriangulator.java | 48 private final ShortArray triangles = new ShortArray();
field in class:EarClippingTriangulator 88 // A polygon with n vertices has a triangulation of n-2 triangles.
89 ShortArray triangles = this.triangles;
local 90 triangles.clear();
91 triangles.ensureCapacity(Math.max(0, vertexCount - 2) * 3);
93 return triangles;
111 ShortArray triangles = this.triangles;
local 113 triangles.add(indices[0]); 187 ShortArray triangles = this.triangles; local [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
draw_pipe_validate.c | 51 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/glshared/ |
glsRasterizationTestUtil.hpp | 72 std::vector<SceneTriangle> triangles; member in struct:deqp::gls::RasterizationTestUtil::TriangleSceneSpec 120 * by RasterizationArguments. Triangles should not be z-clipped. 153 * valid range. Triangles should not be z-clipped.
|
/external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/ |
DelaunayTriangulatorTest.java | 35 ShortArray triangles; field in class:DelaunayTriangulatorTest 81 triangles = trianglulator.computeTriangles(points, false); 95 for (int i = 0; i < triangles.size; i += 3) { 96 int p1 = triangles.get(i) * 2; 97 int p2 = triangles.get(i + 1) * 2; 98 int p3 = triangles.get(i + 2) * 2;
|
PolygonRegionTest.java | 115 short[] triangles = region.getTriangles();
local 132 for (int i = 0, n = triangles.length; i < n; i += 3) {
133 int p1 = triangles[i] * 2;
134 int p2 = triangles[i + 1] * 2;
135 int p3 = triangles[i + 2] * 2;
|
/external/opencv3/modules/imgproc/misc/java/test/ |
Subdiv2DTest.java | 53 MatOfFloat6 triangles = new MatOfFloat6(); local 54 s2d.getTriangleList(triangles); 55 assertEquals(10, triangles.rows()); 57 int cnt = triangles.rows(); 59 triangles.get(0, 0, buff);
|
/external/skia/bench/ |
GLInstancedArraysBench.cpp | 23 * functionality, we draw n * kDrawMultipier triangles per run. If this number is less than 352 uint32_t triangles = SkTMin(trianglesToDraw, maxTrianglesPerFlush); local 353 GR_GL_CALL(gl, DrawArraysInstanced(GR_GL_TRIANGLES, 0, kVerticesPerTri, triangles)); 354 trianglesToDraw -= triangles; 358 uint32_t triangles = SkTMin(trianglesToDraw, maxTrianglesPerFlush); local 359 GR_GL_CALL(gl, DrawArrays(GR_GL_TRIANGLES, 0, kVerticesPerTri * triangles)); 360 trianglesToDraw -= triangles;
|
GLVertexAttributesBench.cpp | 236 uint32_t triangles = SkTMin(trianglesToDraw, maxTrianglesPerFlush); local 237 GR_GL_CALL(gl, DrawArrays(GR_GL_TRIANGLES, 0, kVerticesPerTri * triangles)); 238 trianglesToDraw -= triangles;
|
/external/deqp/modules/gles2/functional/ |
es2fRasterizationTests.cpp | 252 std::vector<TriangleSceneSpec::SceneTriangle> triangles; local 254 generateTriangles(m_iteration, drawBuffer, triangles); 271 scene.triangles.swap(triangles); [all...] |
es2fPolygonOffsetTests.cpp | 1078 const tcu::Vec4 triangles[2][3] = local [all...] |
/external/deqp/modules/gles3/functional/ |
es3fPolygonOffsetTests.cpp | 1081 const tcu::Vec4 triangles[2][3] = local [all...] |
/external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11gears/ |
d3d11gears.cpp | 103 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); 495 fprintf(stderr, "Usage: d3d11gears [-v|-w] [-t TRIANGLES]\n"); 500 fprintf(stderr, "-t TRIANGLES\ttriangle budget (default is 3200)\n"); 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);
|