Lines Matching refs:edges
32 // enable to see triangles edges
650 triangle_dump_edges( Edge* edges,
654 for ( ; count > 0; count--, edges++ )
655 edge_dump( edges );
663 Edge* edges,
672 Edge* edge = edges + *pcount;
728 // sort the edges horizontally
765 Edge edges[3];
770 edge_setup( edges, &num_edges, v0, v1, ymin, ymax );
771 edge_setup( edges, &num_edges, v0, v2, ymin, ymax );
772 edge_setup( edges, &num_edges, v1, v2, ymin, ymax );
777 Edge* left = &edges[0];
778 Edge* right = &edges[1];
779 Edge* other = &edges[2];
784 y_top = min(y_top, edges[2].y_top);
785 y_bot = max(y_bot, edges[2].y_bot);
786 if (edges[0].y_top > y_top) {
787 other = &edges[0];
788 left = &edges[2];
789 } else if (edges[1].y_top > y_top) {
790 other = &edges[1];
791 right = &edges[2];
853 AAEdge* edges,
862 AAEdge* edge = edges + *pcount;
915 return 0; // same edges, should never happen
962 // generate edges from the vertices
967 AAEdge edges[4];
971 aa_edge_setup(edges, &num_edges, p, p+2, ymin, ymax);
973 aa_edge_setup(edges, &num_edges, p, pts, ymin, ymax );
978 qsort(edges, num_edges, sizeof(AAEdge), (compar_t)compare_edges);
983 // now, sweep all edges in order
984 // start with the 2 first edges. We know that they share their top
987 AAEdge* left = &edges[0];
988 AAEdge* right = &edges[1];
1156 left = &edges[i++];
1158 right = &edges[i++];
