Lines Matching refs:minT1
28 double minT1, minT2, maxT1, maxT2;
29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) {
36 if (maxT1 - minT1 < maxT2 - minT2) {
40 split = maxT1 - minT1 > tClipLimit;
42 minT1 = 0;
46 return chop(minT1, maxT1, minT2, maxT2, split);
51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) {
54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller);
71 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]);
73 lineTs.fT[0][0] = interp(minT1, maxT1, lineTs.fT[0][0]);
86 minT1 = (minT1 + maxT1) / 2;
89 minT1 = interp(minT1, maxT1, minT);
93 xy_at_t(cubic1, minT1, pt.x, pt.y);
94 intersections.insert(minT1, minT2, pt);
102 double newMinT1 = interp(minT1, maxT1, minT);
103 double newMaxT1 = interp(minT1, maxT1, maxT);
104 split = (newMaxT1 - newMinT1 > (maxT1 - minT1) * tClipLimit) << 1;
108 __FUNCTION__, depth, splits, newMinT1, newMaxT1, minT1, maxT1,
111 minT1 = newMinT1;
125 return chop(minT1, maxT1, minT2, maxT2, split);
128 bool chop(double minT1, double maxT1, double minT2, double maxT2, int split) {
134 double middle1 = (maxT1 + minT1) / 2;
135 intersect(minT1, middle1, minT2, maxT2);
139 intersect(minT1, maxT1, minT2, middle2);
140 intersect(minT1, maxT1, middle2, maxT2);
147 bool result = intersect(minT1, maxT1, minT2, maxT2);