Lines Matching defs:edges
30 // Tests active edges made inactive by splitting.
59 // Tests active edges which are removed by splitting.
72 // Collinear edges merged in set_top().
73 // Also, an intersection between left and right enclosing edges which
87 // Tests active edges which are made inactive by set_top().
203 // A degenerate segments case which exercises inactive edges being
221 // Tests vertices which become "orphaned" (ie., no connected edges)
276 // adjacent neighbour edges after splitting.
425 // below the bottom of both intersected edges.
457 // Another reduction from crbug.com/851409. Exercises two sequential collinear edges.
469 // Reduction from crbug.com/860655. Cause is three collinear edges discovered during
621 // Reduction from crbug.com/866319. Cause is edges that are collinear when tested from
840 static EdgeMap simplify(const EdgeMap& edges, SkPathFillType fillType) {
841 // Prune out the edges whose count went to zero, and reverse the edges whose count is negative.
843 for (auto [edge, count] : edges) {
845 SkASSERT(edges.find(edge.reverse()) == edges.end());
872 // Count up all the triangulated edges.
877 // Count up all the breadcrumb edges.
884 // The triangulated + breadcrumb edges should cancel out to the inner polygon edges.
887 // Build the inner polygon edges.
921 // The triangulated + breadcrumb edges should cancel out to the inner polygon edges. First
944 // Now verify that there are no spurious edges in the triangulation.
946 // NOTE: The triangulator's definition of wind isn't always correct for edges that run
947 // exactly parallel to the sweep (either vertical or horizontal edges). This doesn't
948 // actually matter though because T-junction artifacts don't happen on axis-aligned edges.
949 // Tolerate spurious edges that (1) come in pairs of 2, and (2) are either exactly
1007 verify_simple_inner_polygons(r, "overlapping rects with vertical collinear edges", SkPath()
1010 verify_simple_inner_polygons(r, "overlapping rects with horizontal collinear edges", SkPath()