Searched defs:vertices (Results 1 - 25 of 95) sorted by path

1234

/external/ceres-solver/internal/ceres/
H A Dgraph.h92 // 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
H A Dgraph_algorithms.h46 // Compare two vertices of a graph by their degrees, if the degrees
79 // Order the vertices of a graph using its (approximately) largest
81 // vertices that have no edges connecting them. The maximum
84 // breadth first search that explores the vertices in order of
90 // search where the vertices are explored in increasing order of their
98 const HashSet<Vertex>& vertices = graph.vertices(); local
99 const int num_vertices = vertices.size();
110 // Mark all vertices white.
113 for (typename HashSet<Vertex>::const_iterator it = vertices
175 const HashSet<Vertex>& vertices = graph.vertices(); local
287 const HashSet<Vertex>& vertices = graph.vertices(); local
[all...]
H A Dgraph_algorithms_test.cc113 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);
H A Dgraph_test.cc42 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);
H A Dparameter_block_ordering.cc51 const HashSet<ParameterBlock*>& vertices = graph->vertices(); local
53 if (vertices.count(parameter_blocks[i]) > 0) {
H A Dparameter_block_ordering_test.cc88 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
[all...]
H A Dsingle_linkage_clustering.cc52 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();
H A Dvisibility_based_preconditioner.cc155 // vertices and approximating it with a degree-2 maximum spanning
504 const HashSet<int>& vertices = forest.vertices(); local
505 CHECK_EQ(vertices.size(), num_clusters_);
509 for (HashSet<int>::const_iterator it1 = vertices.begin();
510 it1 != vertices.end();
541 // Construct a graph whose vertices are the clusters, and the edge
543 // vertices.
574 // Canonical views clustering returns a HashMap from vertices to
576 // possible that some of the vertices ma
[all...]
/external/deqp/framework/referencerenderer/
H A DrrPrimitiveAssembler.hpp80 static void exec (Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
85 *(outputIterator++) = Triangle(vertices[ndx], vertices[ndx+1], vertices[ndx+2], provokingOffset);
88 static size_t getPrimitiveCount (size_t vertices) argument
90 return vertices / 3;
97 static void exec (Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
104 VertexPacket* vert0 = vertices[0];
105 VertexPacket* vert1 = vertices[1];
114 *(outputIterator++) = Triangle(vert0, vert1, vertices[nd
133 getPrimitiveCount(size_t vertices) argument
142 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
157 getPrimitiveCount(size_t vertices) argument
205 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
213 getPrimitiveCount(size_t vertices) argument
222 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
239 getPrimitiveCount(size_t vertices) argument
248 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
267 getPrimitiveCount(size_t vertices) argument
296 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
304 getPrimitiveCount(size_t vertices) argument
358 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
366 getPrimitiveCount(size_t vertices) argument
375 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
383 getPrimitiveCount(size_t vertices) argument
444 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
452 getPrimitiveCount(size_t vertices) argument
461 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument
504 getPrimitiveCount(size_t vertices) argument
[all...]
H A DrrPrimitivePacket.hpp45 const VertexPacket* vertices[6]; member in struct:rr::PrimitivePacket
51 * Geometry emitter handles outputting of new vertices from geometry shader
H A DrrRenderer.cpp271 TriangleVertex vertices[3]; member in struct:rr::__anon3101::cliputil::SubTriangle
436 void clipTriangleToPlane (std::vector<TriangleVertex>& clippedEdges, const TriangleVertex* vertices, const ClipVolumePlane& plane) argument
438 const bool v0Clipped = !plane.pointInClipVolume(vertices[0].position);
439 const bool v1Clipped = !plane.pointInClipVolume(vertices[1].position);
440 const bool v2Clipped = !plane.pointInClipVolume(vertices[2].position);
446 clippedEdges.insert(clippedEdges.begin(), vertices, vertices + 3);
451 if (v0Clipped) clipTriangleOneVertex(clippedEdges, plane, vertices[0], vertices[1], vertices[
860 makeSharedVerticeDistinct(VertexPacket*& packet, std::set<VertexPacket*, std::less<void*> >& vertices, VertexPacketAllocator& vpalloc) argument
884 makeSharedVerticesDistinct(pa::Triangle& target, std::set<VertexPacket*, std::less<void*> >& vertices, VertexPacketAllocator& vpalloc) argument
891 makeSharedVerticesDistinct(pa::Line& target, std::set<VertexPacket*, std::less<void*> >& vertices, VertexPacketAllocator& vpalloc) argument
897 makeSharedVerticesDistinct(pa::Point& target, std::set<VertexPacket*, std::less<void*> >& vertices, VertexPacketAllocator& vpalloc) argument
905 std::set<VertexPacket*, std::less<void*> > vertices; local
1386 drawGeometryShaderOutputAsPrimitives(const RenderState& state, const RenderTarget& renderTarget, const Program& program, VertexPacket* const* vertices, size_t numVertices, VertexPacketAllocator& vpalloc) argument
1473 drawAsPrimitives(const RenderState& state, const RenderTarget& renderTarget, const Program& program, VertexPacket* const* vertices, int numVertices, DrawContext& drawContext, VertexPacketAllocator& vpalloc) argument
[all...]
/external/deqp/modules/gles3/functional/
H A Des3fFragmentOutputTests.cpp397 static void renderFloatReference (const tcu::PixelBufferAccess& dst, int gridWidth, int gridHeight, int numComponents, const float* vertices) argument
411 const Vec4 v00 = readVec4(vertices + ((cellY+0)*gridWidth + cellX+0)*numComponents, numComponents);
412 const Vec4 v01 = readVec4(vertices + ((cellY+1)*gridWidth + cellX+0)*numComponents, numComponents);
413 const Vec4 v10 = readVec4(vertices + ((cellY+0)*gridWidth + cellX+1)*numComponents, numComponents);
414 const Vec4 v11 = readVec4(vertices + ((cellY+1)*gridWidth + cellX+1)*numComponents, numComponents);
428 static void renderIntReference (const tcu::PixelBufferAccess& dst, int gridWidth, int gridHeight, int numComponents, const int* vertices) argument
439 IVec4 c = readIVec4(vertices + (cellY*gridWidth + cellX+1)*numComponents, numComponents);
H A Des3fRasterizerDiscardTests.cpp253 std::vector<float> vertices; local
304 // Generate vertices
307 generateVertices (vertices, m_numPrimitives, m_rnd, m_drawMode);
308 glVertexAttribPointer (0, 4, GL_FLOAT, GL_FALSE, 0, &vertices[0]);
334 case CASE_WRITE_DEPTH: glDrawArrays(m_drawMode, 0, (int)vertices.size() / 4); break;
335 case CASE_WRITE_STENCIL: glDrawArrays(m_drawMode, 0, (int)vertices.size() / 4); break;
364 glDrawArrays (m_drawMode, 0, (int)vertices.size() / 4);
H A Des3fSyncTests.cpp174 std::vector<float> vertices; local
189 // Generate vertices
192 generateVertices (vertices, m_numPrimitives, m_rnd);
193 glVertexAttribPointer (0, 4, GL_FLOAT, GL_FALSE, 0, &vertices[0]);
197 glDrawArrays(GL_TRIANGLES, 0, (int)vertices.size() / 4);
/external/deqp/modules/gles3/stress/
H A Des3sOcclusionQueryTests.cpp151 std::vector<float> vertices; local
172 vertices.resize(4*NUM_GENERATED_VERTICES);
176 vertices[4*i ] = m_rnd.getFloat(-1.0f, 1.0f);
177 vertices[4*i + 1] = m_rnd.getFloat(-1.0f, 1.0f);
178 vertices[4*i + 2] = m_rnd.getFloat(0.0f, 1.0f);
179 vertices[4*i + 3] = 1.0f;
189 occluderVertices[4*i ] = vertices[4*vtxNdx];
190 occluderVertices[4*i + 1] = vertices[4*vtxNdx + 1];
191 occluderVertices[4*i + 2] = vertices[4*vtxNdx + 2];
192 occluderVertices[4*i + 3] = vertices[
[all...]
H A Des3sSyncTests.cpp162 std::vector<float> vertices; local
177 // Generate vertices
180 generateVertices (vertices, m_numSyncs, m_rnd);
181 glVertexAttribPointer (0, 4, GL_FLOAT, GL_FALSE, 0, &vertices[0]);
/external/deqp/modules/gles31/functional/
H A Des31fLayoutBindingTests.cpp390 const Vec3 vertices[] = local
415 gl.bufferData(GL_ARRAY_BUFFER, (DE_LENGTH_OF_ARRAY(vertices)*(glw::GLsizeiptr)sizeof(vertices[0])), &vertices[0], GL_STATIC_DRAW);
H A Des31fNegativeVertexArrayApiTests.cpp356 GLfloat vertices[1]; local
359 ctx.glDrawElements(-1, 1, GL_UNSIGNED_BYTE, vertices);
364 ctx.glDrawElements(GL_POINTS, 1, -1, vertices);
366 ctx.glDrawElements(GL_POINTS, 1, GL_FLOAT, vertices);
371 ctx.glDrawElements(GL_POINTS, -1, GL_UNSIGNED_BYTE, vertices);
379 ctx.glDrawElements(GL_POINTS, 1, GL_UNSIGNED_BYTE, vertices);
403 ctx.glDrawElements (GL_POINTS, 1, GL_UNSIGNED_BYTE, vertices);
407 ctx.glDrawElements (GL_POINTS, 1, GL_UNSIGNED_BYTE, vertices);
424 GLfloat vertices[1]; local
427 ctx.glDrawElements(-1, 1, GL_UNSIGNED_BYTE, vertices);
461 GLfloat vertices[1]; local
628 GLfloat vertices[1]; local
700 GLfloat vertices[1]; local
741 GLfloat vertices[1]; local
816 GLfloat vertices[1]; local
889 GLfloat vertices[1]; local
931 GLfloat vertices[1]; local
[all...]
H A Des31fShaderHelperInvocationTests.cpp169 vector<Vec2> vertices; local
172 genVertices(primType, numPrimitives, rnd, &vertices);
174 vertexArrays.push_back(glu::va::Float("a_position", 2, (int)vertices.size(), 0, (const float*)&vertices[0]));
197 glu::PrimitiveList(getGluPrimitiveType(primType), (int)vertices.size()));
/external/deqp/modules/glshared/
H A DglsScissorTests.cpp98 void drawPrimitives (const glw::Functions& gl, deUint32 program, const deUint32 type, const vector<float>& vertices, const vector<deUint16>& indices) argument
106 gl.vertexAttribPointer(posLoc, 4, GL_FLOAT, GL_FALSE, 0, &vertices[0]);
/external/eigen/demos/opengl/
H A Dgpuhelper.cpp100 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[
[all...]
H A Dicosphere.h20 const std::vector<Eigen::Vector3f>& vertices() const { return mVertices; } function in class:IcoSphere
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/meshes/
H A DMeshHelper.java116 // reading vertices
117 Vector3f[] vertices = this.getVertices(structure, blenderContext);
118 int verticesAmount = vertices.length;
120 // vertices Colors
157 // this map's key is the vertex index from 'vertices 'table and the value are indices from 'vertexList'
199 Vector3f n = FastMath.computeNormal(vertices[v1], vertices[v2], vertices[v3]);
200 this.addNormal(n, normalMap, smooth, vertices[v1], vertices[v
440 addNormal(Vector3f normalToAdd, Map<Vector3f, Vector3f> normalMap, boolean smooth, Vector3f... vertices) argument
[all...]
/external/jmonkeyengine/engine/src/bullet-native/
H A Dcom_jme3_bullet_util_NativeMeshUtil.cpp52 float* vertices = (float*) env->GetDirectBufferAddress(vertexIndexBase); local
53 btTriangleIndexVertexArray* array = new btTriangleIndexVertexArray(numTriangles, triangles, triangleIndexStride, numVertices, vertices, vertexStride);
/external/jmonkeyengine/engine/src/core/com/jme3/effect/shapes/
H A DEmitterMeshVertexShape.java20 * This emiter shape emits the particles from the given shape's vertices
25 protected List<List<Vector3f>> vertices; field in class:EmitterMeshVertexShape
51 this.vertices = new ArrayList<List<Vector3f>>(meshes.size());
70 // adding data to vertices and normals
71 List<Vector3f> vertices = new ArrayList<Vector3f>(vertToNormalMap.size());
74 vertices.add(entry.getKey());
77 this.vertices.add(vertices);
89 int meshIndex = FastMath.nextRandomInt(0, vertices.size() - 1);
90 int vertIndex = FastMath.nextRandomInt(0, vertices
[all...]

Completed in 506 milliseconds

1234