Lines Matching defs:edges
154 // long edges and effectively perform a binary search to perform a more accurate intersection test.
255 // If the two edges share a vertex by construction, they have already been split and
635 void GrTriangulator::FindEnclosingEdges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) {
643 for (prev = edges->fTail; prev != nullptr; prev = prev->fLeft) {
715 TESS_LOG("rewinding active edges from vertex %g to vertex %g\n", v->fID, dst->fID);
805 TESS_LOG("merging coincident above edges (%g, %g) -> (%g, %g)\n",
826 TESS_LOG("merging coincident below edges (%g, %g) -> (%g, %g)\n",
910 // is valid for both edges.
1159 // Stage 2: convert the contours to a mesh of edges connecting the vertices.
1282 static void validate_edge_list(EdgeList* edges, const Comparator& c) {
1283 Edge* left = edges->fHead;
1294 // Stage 4: Simplify the mesh by inserting new vertices at intersecting edges.
1377 TESS_LOG("edges above:\n");
1384 TESS_LOG("edges below:\n");
1455 TESS_LOG("\nactive edges:\n");