3 edgestyle_t edgestyle_default;
5 windstate_t windstate_nonfilled = {
10 // -------------------- even/odd ----------------------
12 windstate_t evenodd_start(windcontext_t*context)
14 return windstate_nonfilled;
16 windstate_t evenodd_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
22 edgestyle_t* evenodd_diff(windstate_t*left, windstate_t*right)
24 if(left->is_filled==right->is_filled)
27 return &edgestyle_default;
30 windrule_t windrule_evenodd = {
36 // -------------------- circular ----------------------
38 edgestyle_t edgestyle_down;
39 edgestyle_t edgestyle_up;
41 windstate_t circular_start(windcontext_t*context)
43 return windstate_nonfilled;
46 windstate_t circular_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
49 /* which one is + and which one - doesn't actually make any difference */
55 left.is_filled = left.wind_nr != 0;
59 edgestyle_t* circular_diff(windstate_t*left, windstate_t*right)
61 if(left->is_filled==right->is_filled)
64 return &edgestyle_default;
67 windrule_t windrule_circular = {
68 start: circular_start,
73 // -------------------- intersect ----------------------
75 windstate_t intersect_start(windcontext_t*context)
77 return windstate_nonfilled;
80 windstate_t intersect_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
82 assert(master < context->num_polygons);
84 left.wind_nr ^= 1<<master;
85 left.is_filled = (left.wind_nr == (1<<context->num_polygons)-1);
89 edgestyle_t* intersect_diff(windstate_t*left, windstate_t*right)
91 if(left->is_filled==right->is_filled)
94 return &edgestyle_default;
97 windrule_t windrule_intersect = {
98 start: intersect_start,
100 diff: intersect_diff,
103 // -------------------- union ----------------------
105 windstate_t union_start(windcontext_t*context)
107 return windstate_nonfilled;
110 windstate_t union_add(windcontext_t*context, windstate_t left, edgestyle_t*edge, segment_dir_t dir, int master)
112 assert(master<sizeof(left.wind_nr)*8); //up to 32/64 polygons max
113 left.wind_nr ^= 1<<master;
114 left.is_filled = (left.wind_nr!=0);
118 edgestyle_t* union_diff(windstate_t*left, windstate_t*right)
120 if(left->is_filled==right->is_filled)
123 return &edgestyle_default;
126 windrule_t windrule_union = {
134 } else if (rule == WIND_NONZERO) {
136 } else if (rule == WIND_ODDEVEN) {
138 } else { // rule == WIND_POSITIVE