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

/external/skia/src/core/
H A DSkConcaveToTriangles.h28 SkTDArray<SkPoint> *triangles);
H A DSkConcaveToTriangles.cpp17 // No new vertices are created in the triangulation: triangles are constructed
809 SkTDArray<SkPoint> *triangles) {
810 SkPoint *p = triangles->append(3);
858 SkTDArray<SkPoint> *triangles) {
891 appendTriangleAtVertex(current, triangles);
892 if (triangles->count() > kMaxCount * 3) {
893 FailureMessage("An extraordinarily large number of triangles "
905 appendTriangleAtVertex(current, triangles);
917 // TriangulateMonotone() to convert them into triangles.
918 bool Triangulate(Vertex *first, Vertex *last, SkTDArray<SkPoint> *triangles) { argument
808 appendTriangleAtVertex(const Vertex *v, SkTDArray<SkPoint> *triangles) argument
857 TriangulateMonotone(Vertex *first, Vertex *last, SkTDArray<SkPoint> *triangles) argument
947 SkConcaveToTriangles(size_t numPts, const SkPoint pts[], SkTDArray<SkPoint> *triangles) argument
[all...]
/external/skia/tests/
H A DTriangulationTest.cpp23 static void PrintTriangles(const SkTDArray<SkPoint> &triangles, argument
27 SkPoint *p = triangles.begin();
28 int n = triangles.count();
48 const SkTDArray<SkPoint> &triangles) {
49 if (triangles.count() != numTriangles * 3) {
50 printf("Expected %d triangles, not %d\n",
51 numTriangles, triangles.count() / 3);
57 const SkScalar *t = &triangles[i * 3].fX;
68 printf("%d triangles differ\n", numErrors);
180 SkTDArray<SkPoint> triangles; local
46 CompareTriangleList(int numTriangles, const float refTriangles[][3][2], const SkTDArray<SkPoint> &triangles) argument
211 SkTDArray<SkPoint> triangles; local
237 SkTDArray<SkPoint> triangles; local
280 SkTDArray<SkPoint> triangles; local
[all...]
/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/skia/samplecode/
H A DSampleTriangles.cpp75 SkTDArray<SkPoint> triangles; local
76 if (SkConcaveToTriangles(n, pts, &triangles)) {
78 triangles.count(), triangles.begin(), NULL,
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
H A D3d-raytrace.js182 this.triangles = a_triangles;
191 for (i = 0; i < this.triangles.length; i++) {
192 var triangle = this.triangles[i];
247 for (i = 0; i < this.triangles.length; i++) {
248 var triangle = this.triangles[i];
317 var triangles = new Array();//numTriangles);
331 triangles[i++] = new Triangle(tfl, tfr, bfr);
332 triangles[i++] = new Triangle(tfl, bfr, bfl);
334 triangles[i++] = new Triangle(tbl, tbr, bbr);
335 triangles[
[all...]
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
H A D3d-raytrace.js182 this.triangles = a_triangles;
191 for (i = 0; i < this.triangles.length; i++) {
192 var triangle = this.triangles[i];
247 for (i = 0; i < this.triangles.length; i++) {
248 var triangle = this.triangles[i];
317 var triangles = new Array();//numTriangles);
331 triangles[i++] = new Triangle(tfl, tfr, bfr);
332 triangles[i++] = new Triangle(tfl, bfr, bfl);
334 triangles[i++] = new Triangle(tbl, tbr, bbr);
335 triangles[
[all...]
/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/quake/quake/src/QW/client/
H A Dgl_mesh.c67 last = &triangles[starttri];
81 for (j=starttri+1, check=&triangles[starttri+1] ; j<pheader->numtris ; j++, check++)
136 last = &triangles[starttri];
151 for (j=starttri+1, check=&triangles[starttri+1] ; j<pheader->numtris ; j++, check++)
261 if (!triangles[besttris[0]].facesfront && stverts[k].onseam)
H A Dmodel.h290 int triangles; member in struct:__anon11377
H A Dgl_model.h325 extern mtriangle_t triangles[MAXALIASTRIS];
H A Dr_alias.c303 // clip and draw all triangles
307 ptri = (mtriangle_t *)((byte *)paliashdr + paliashdr->triangles);
550 ((byte *)paliashdr + paliashdr->triangles);
H A Dgl_model.c1263 mtriangle_t triangles[MAXALIASTRIS]; variable
1590 Sys_Error ("model %s has no triangles", mod->name);
1634 triangles[i].facesfront = LittleLong (pintriangles[i].facesfront);
1638 triangles[i].vertindex[j] =
H A Dmodel.c1530 Sys_Error ("model %s has no triangles", mod->name);
1607 // set up the triangles
1612 pheader->triangles = (byte *)ptri - (byte *)pheader;
/external/quake/quake/src/WinQuake/
H A Dgl_mesh.cpp67 last = &triangles[starttri];
81 for (j=starttri+1, check=&triangles[starttri+1] ; j<pheader->numtris ; j++, check++)
136 last = &triangles[starttri];
151 for (j=starttri+1, check=&triangles[starttri+1] ; j<pheader->numtris ; j++, check++)
271 if (!triangles[besttris[0]].facesfront && stverts[k].onseam)
H A Dmodel.h279 int triangles; member in struct:__anon11737
H A Dgl_model.h322 extern mtriangle_t triangles[MAXALIASTRIS];
H A Dr_alias.cpp303 // clip and draw all triangles
307 ptri = (mtriangle_t *)((byte *)paliashdr + paliashdr->triangles);
550 ((byte *)paliashdr + paliashdr->triangles);
H A Dgl_model.cpp1237 mtriangle_t triangles[MAXALIASTRIS]; variable
1544 Sys_Error ("model %s has no triangles", mod->name);
1588 triangles[i].facesfront = LittleLong (pintriangles[i].facesfront);
1592 triangles[i].vertindex[j] =
H A Dmodel.cpp1508 Sys_Error ("model %s has no triangles", mod->name);
1585 // set up the triangles
1590 pheader->triangles = (byte *)ptri - (byte *)pheader;
/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/skia/third_party/glu/libtess/
H A Dalg-outline18 input is even slightly non-planar, then some triangles will
42 5. Group the triangles into strips and fans.
226 triangles into fans and strips. We do this using a greedy approach.
H A DREADME23 rather than a list of independent triangles (when possible).
264 tesselation. All output triangles are oriented CCW with
403 tri number of triangles in all output primitives
406 ind number of independent triangles

Completed in 321 milliseconds