HomeSort by relevance Sort by last modified time
    Searched defs:vertices (Results 1 - 25 of 194) sorted by null

1 2 3 4 5 6 7 8

  /external/ceres-solver/internal/ceres/
graph_test.cc 42 EXPECT_EQ(graph.vertices().size(), 0);
51 const HashSet<int>& vertices = graph.vertices(); local
52 EXPECT_EQ(vertices.size(), 2);
67 const HashSet<int>& vertices = graph.vertices(); local
69 EXPECT_EQ(vertices.size(), 2);
73 EXPECT_EQ(vertices.size(), 2);
graph_algorithms_test.cc 113 const HashSet<int>& vertices = forest->vertices(); local
114 EXPECT_EQ(vertices.size(), 2);
135 const HashSet<int>& vertices = forest->vertices(); local
136 EXPECT_EQ(vertices.size(), 5);
single_linkage_clustering.cc 52 const HashSet<int>& vertices = graph.vertices(); local
53 for (HashSet<int>::const_iterator it = vertices.begin();
54 it != vertices.end();
59 for (HashSet<int>::const_iterator it1 = vertices.begin();
60 it1 != vertices.end();
graph.h 92 // AddEdge on a pair of vertices which do not exist in the graph yet
96 // vertices.
123 // Calling EdgeWeight on a pair of vertices where either one of the
124 // vertices is not present in the graph will result in undefined
141 const HashSet<Vertex>& vertices() const { function in class:ceres::internal::Graph
parameter_block_ordering.cc 51 const HashSet<ParameterBlock*>& vertices = graph->vertices(); local
53 if (vertices.count(parameter_blocks[i]) > 0) {
parameter_block_ordering_test.cc 88 const VertexSet& vertices = graph->vertices(); local
89 EXPECT_EQ(vertices.size(), 4);
92 EXPECT_TRUE(vertices.find(parameter_blocks[i]) != vertices.end());
132 EXPECT_EQ(graph->vertices().size(), 0);
142 const VertexSet& vertices = graph->vertices(); local
144 EXPECT_EQ(vertices.size(), 3);
145 EXPECT_TRUE(vertices.find(parameter_blocks[0]) == vertices.end())
    [all...]
  /external/eigen/demos/opengl/
icosphere.h 20 const std::vector<Eigen::Vector3f>& vertices() const { return mVertices; } function in class:IcoSphere
gpuhelper.cpp 100 static float vertices[][3] = { local
111 glNormal3f(0,0,-1); glVertex3fv(vertices[0]); glVertex3fv(vertices[2]); glVertex3fv(vertices[3]); glVertex3fv(vertices[1]);
112 glNormal3f(0,0, 1); glVertex3fv(vertices[4]); glVertex3fv(vertices[5]); glVertex3fv(vertices[7]); glVertex3fv(vertices[6]);
113 glNormal3f(0,-1,0); glVertex3fv(vertices[0]); glVertex3fv(vertices[1]); glVertex3fv(vertices[5]); glVertex3fv(vertices[4])
    [all...]
  /external/opencv3/modules/viz/src/vtk/
vtkCloudMatSource.h 76 vtkSmartPointer<vtkCellArray> vertices; member in class:cv::viz::vtkCloudMatSource
  /external/deqp/framework/referencerenderer/
rrPrimitivePacket.hpp 45 const VertexPacket* vertices[6]; member in struct:rr::PrimitivePacket
51 * Geometry emitter handles outputting of new vertices from geometry shader
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
btConvexHullComputer.h 68 // Vertices of the output hull
69 btAlignedObjectArray<btVector3> vertices; member in class:btConvexHullComputer
78 Compute convex hull of "count" vertices stored in "coords". "stride" is the difference in bytes
79 between the addresses of consecutive vertices. If "shrink" is positive, the convex hull is shrunken
87 The output convex hull can be found in the member variables "vertices", "edges", "faces".
  /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/model/data/
ModelMesh.java 24 public float[] vertices; field in class:ModelMesh
  /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/gles2/
Shapes.java 43 float[] vertices = new float[24 * 8]; local
47 for (int i = 0; i < vertices.length;) {
48 vertices[i++] = cubeVerts[pIdx++];
49 vertices[i++] = cubeVerts[pIdx++];
50 vertices[i++] = cubeVerts[pIdx++];
51 vertices[i++] = cubeNormals[nIdx++];
52 vertices[i++] = cubeNormals[nIdx++];
53 vertices[i++] = cubeNormals[nIdx++];
54 vertices[i++] = cubeTex[tIdx++];
55 vertices[i++] = cubeTex[tIdx++];
    [all...]
HelloTriangle.java 41 float[] vertices = {0.0f, 0.5f, 0.0f, -0.5f, -0.5f, 0.0f, 0.5f, -0.5f, 0.0f}; local
42 mesh.setVertices(vertices);
  /external/opencv3/modules/core/test/
test_rotatedrect.cpp 91 Point2f vertices[4]; local
92 rec.points(vertices);
96 if( norm(vertices[i] - a) <= 0.001 ) count_match++;
97 else if( norm(vertices[i] - b) <= 0.001 ) count_match++;
98 else if( norm(vertices[i] - c) <= 0.001 ) count_match++;
  /external/opencv3/modules/imgproc/test/
test_intersection.cpp 116 vector<Point2f> vertices; local
118 int ret = rotatedRectangleIntersection(rect1, rect2, vertices);
121 CV_Assert(vertices.empty());
142 vector<Point2f> vertices; local
144 int ret = rotatedRectangleIntersection(rect1, rect2, vertices);
147 CV_Assert(vertices.size() == 4);
156 for( size_t i = 0; i < vertices.size(); i++ )
162 double dx = vertices[i].x - possibleVertices[j].x;
163 double dy = vertices[i].y - possibleVertices[j].y;
190 vector<Point2f> vertices;
    [all...]
  /external/opencv3/modules/stitching/include/opencv2/stitching/detail/
util_inl.hpp 72 std::queue<int> vertices; local
75 vertices.push(from);
77 while (!vertices.empty())
79 int vertex = vertices.front();
80 vertices.pop();
89 vertices.push(edge->to);
  /frameworks/base/libs/hwui/
Patch.h 51 std::unique_ptr<TextureVertex[]> vertices; member in class:android::uirenderer::Patch
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/projection/cube/
Cube.java 33 int vertices[] = { local
72 ByteBuffer vbb = ByteBuffer.allocateDirect(vertices.length*4);
75 mVertexBuffer.put(vertices);
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
Cube.java 33 int vertices[] = { local
72 ByteBuffer vbb = ByteBuffer.allocateDirect(vertices.length*4);
75 mVertexBuffer.put(vertices);
  /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g2d/
PolygonRegion.java 25 final float[] vertices; // pixel coordinates relative to source image. field in class:PolygonRegion
29 /** Creates a PolygonRegion by triangulating the polygon coordinates in vertices and calculates uvs based on that. TextureRegion
32 * @param vertices contains 2D polygon coordinates in pixels relative to source region */
33 public PolygonRegion (TextureRegion region, float[] vertices, short[] triangles) {
35 this.vertices = vertices;
38 float[] textureCoords = this.textureCoords = new float[vertices.length];
44 for (int i = 0, n = vertices.length; i < n; i++) {
45 textureCoords[i] = u + uvWidth * (vertices[i] / width);
47 textureCoords[i] = v + uvHeight * (1 - (vertices[i] / height));
    [all...]
  /external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d10tri/
d3d10tri.cpp 36 static struct vertex vertices[3] = variable in typeref:struct:vertex
72 bufferd.ByteWidth = sizeof(vertices);
79 buffersd.pSysMem = vertices;
80 buffersd.SysMemPitch = sizeof(vertices);
81 buffersd.SysMemSlicePitch = sizeof(vertices);
  /external/mesa3d/src/gallium/state_trackers/d3d1x/progs/d3d11tri/
d3d11tri.cpp 36 static struct vertex vertices[3] = variable in typeref:struct:vertex
73 bufferd.ByteWidth = sizeof(vertices);
81 buffersd.pSysMem = vertices;
82 buffersd.SysMemPitch = sizeof(vertices);
83 buffersd.SysMemSlicePitch = sizeof(vertices);
  /external/skia/gm/
patchgrid.cpp 79 SkPoint vertices[4][5] = { variable
119 points[SkPatchUtils::kTopP0_CubicCtrlPts] = vertices[i][j];
120 points[SkPatchUtils::kTopP3_CubicCtrlPts] = vertices[i][j + 1];
121 points[SkPatchUtils::kBottomP0_CubicCtrlPts] = vertices[i + 1][j];
122 points[SkPatchUtils::kBottomP3_CubicCtrlPts] = vertices[i + 1][j + 1];
  /external/skia/src/gpu/batches/
GrTInstanceBatch.h 39 * Tesselate(intptr_t vertices, size_t vertexStride, const Geometry& geo,
107 void* vertices = helper.init(target, kTriangles_GrPrimitiveType, vertexStride, variable
110 if (!vertices || !indexBuffer) {
111 SkDebugf("Could not allocate vertices\n");
116 intptr_t verts = reinterpret_cast<intptr_t>(vertices) +

Completed in 1015 milliseconds

1 2 3 4 5 6 7 8