Searched defs:vertex2 (Results 1 - 7 of 7) sorted by relevance
/external/ceres-solver/internal/ceres/ |
H A D | single_linkage_clustering.cc | 67 const int vertex2 = *it2; local 71 if ((vertex1 > vertex2) || 72 (graph.EdgeWeight(vertex1, vertex2) < options.min_similarity)) { 78 const int c2 = FindConnectedComponent(vertex2, membership);
|
H A D | graph.h | 91 // Add a weighted edge between the vertex1 and vertex2. Calling 97 void AddEdge(const Vertex& vertex1, const Vertex& vertex2, double weight) { argument 99 DCHECK(vertices_.find(vertex2) != vertices_.end()); 101 if (edges_[vertex1].insert(vertex2).second) { 102 edges_[vertex2].insert(vertex1); 105 if (vertex1 < vertex2) { 106 edge_weights_[make_pair(vertex1, vertex2)] = weight; 108 edge_weights_[make_pair(vertex2, vertex1)] = weight; 113 void AddEdge(const Vertex& vertex1, const Vertex& vertex2) { argument 114 AddEdge(vertex1, vertex2, 1. [all...] |
H A D | graph_algorithms.h | 299 const Vertex vertex2 = *it2; local 300 if (vertex1 >= vertex2) { 303 const double weight = graph.EdgeWeight(vertex1, vertex2); 304 weighted_edges.push_back(make_pair(weight, make_pair(vertex1, vertex2))); 318 const Vertex vertex2 = edge.second; local 324 (forest->Neighbors(vertex2).size() == 2)) { 333 Vertex root2 = FindConnectedComponent(vertex2, &disjoint_set); 341 const double edge_weight = graph.EdgeWeight(vertex1, vertex2); 342 forest->AddEdge(vertex1, vertex2, edge_weight); 343 forest->AddEdge(vertex2, vertex [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatPolygon.cpp | 52 static inline bool isPointOnLineSegment(const FloatPoint& vertex1, const FloatPoint& vertex2, const FloatPoint& point) argument 54 return point.x() >= std::min(vertex1.x(), vertex2.x()) 55 && point.x() <= std::max(vertex1.x(), vertex2.x()) 56 && areCollinearPoints(vertex1, vertex2, point); 122 if (areCollinearPoints(lastEdge.vertex1(), lastEdge.vertex2(), firstEdge.vertex2())) { 154 static inline float leftSide(const FloatPoint& vertex1, const FloatPoint& vertex2, const FloatPoint& point) 156 return ((point.x() - vertex1.x()) * (vertex2.y() - vertex1.y())) - ((vertex2.x() - vertex1.x()) * (point.y() - vertex1.y())); 164 const FloatPoint& vertex2 [all...] |
/external/deqp/modules/gles2/functional/ |
H A D | es2fShaderInvarianceTests.cpp | 215 const tcu::Vec4 vertex2 = genRandomVector(rnd); local 216 const tcu::Vec4 vertex3 = vertex2 + genRandomVector(rnd) * 0.01f; // generate narrow triangles 219 triangles[triNdx*3 + 1] = vertex2;
|
/external/deqp/modules/gles3/functional/ |
H A D | es3fShaderInvarianceTests.cpp | 215 const tcu::Vec4 vertex2 = genRandomVector(rnd); local 216 const tcu::Vec4 vertex3 = vertex2 + genRandomVector(rnd) * 0.01f; // generate narrow triangles 219 triangles[triNdx*3 + 1] = vertex2;
|
/external/pdfium/core/src/fpdfapi/fpdf_render/ |
H A D | fpdf_render_pattern.cpp | 330 CPDF_MeshVertex& vertex2 = triangle[(i + 1) % 3];
local 332 vertex2.x, vertex2.y, inter_x[nIntersects]);
336 r[nIntersects] = vertex1.r + FXSYS_MulDiv(vertex2.r - vertex1.r, y - vertex1.y, vertex2.y - vertex1.y);
337 g[nIntersects] = vertex1.g + FXSYS_MulDiv(vertex2.g - vertex1.g, y - vertex1.y, vertex2.y - vertex1.y);
338 b[nIntersects] = vertex1.b + FXSYS_MulDiv(vertex2.b - vertex1.b, y - vertex1.y, vertex2.y - vertex1.y);
|
Completed in 160 milliseconds