| /external/skia/experimental/Intersection/ |
| D | CubicConvexHull.cpp | 28 double minT1, minT2, maxT1, maxT2; in intersect() local
32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) { in intersect()
36 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
39 maxT2 = 1; in intersect()
44 split = (maxT2 - minT2 > tClipLimit) << 1; in intersect()
46 return chop(minT1, maxT1, minT2, maxT2, split); in intersect()
51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { in intersect() argument
55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); in intersect()
70 lineTs.fT[0][0] = interp(minT2, maxT2, lineTs.fT[0][0]); in intersect()
74 lineTs.fT[1][0] = interp(minT2, maxT2, lineTs.fT[1][0]); in intersect()
[all …]
|
| D | QuadraticIntersection.cpp | 31 double minT1, minT2, maxT1, maxT2; in intersect() local
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) { in intersect()
41 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
44 maxT2 = 1; in intersect()
49 split = (maxT2 - minT2 > tClipLimit) << 1; in intersect()
51 return chop(minT1, maxT1, minT2, maxT2, split); in intersect()
56 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { in intersect() argument
58 bool t2IsLine = maxT2 - minT2 <= quad2Divisions; in intersect()
60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine); in intersect()
65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger); in intersect()
[all …]
|
| D | CubicIntersection_Test.cpp | 418 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
422 sub_divide(cubic2, minT2, maxT2, sub2);
430 t2 = minT2 + i.fT[1][0] * (maxT2 - minT2);
437 double half2 = (minT2 + maxT2) / 2;
441 result = intersect(minT1, half1, minT2, maxT2) || intersect(half1, maxT1, minT2, maxT2)
442 || intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT1, half2, maxT2);
444 result = intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT1, half2, maxT2)
445 || intersect(minT1, half1, minT2, maxT2) || intersect(half1, maxT1, minT2, maxT2);
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | CubicConvexHull.cpp | 28 double minT1, minT2, maxT1, maxT2; in intersect() local
32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) { in intersect()
36 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
39 maxT2 = 1; in intersect()
44 split = (maxT2 - minT2 > tClipLimit) << 1; in intersect()
46 return chop(minT1, maxT1, minT2, maxT2, split); in intersect()
51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { in intersect() argument
55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); in intersect()
70 lineTs.fT[0][0] = interp(minT2, maxT2, lineTs.fT[0][0]); in intersect()
74 lineTs.fT[1][0] = interp(minT2, maxT2, lineTs.fT[1][0]); in intersect()
[all …]
|
| D | QuadraticIntersection.cpp | 31 double minT1, minT2, maxT1, maxT2; in intersect() local
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) { in intersect()
41 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
44 maxT2 = 1; in intersect()
49 split = (maxT2 - minT2 > tClipLimit) << 1; in intersect()
51 return chop(minT1, maxT1, minT2, maxT2, split); in intersect()
56 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { in intersect() argument
58 bool t2IsLine = maxT2 - minT2 <= quad2Divisions; in intersect()
60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine); in intersect()
65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger); in intersect()
[all …]
|
| D | CubicIntersection_Test.cpp | 418 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
422 sub_divide(cubic2, minT2, maxT2, sub2);
430 t2 = minT2 + i.fT[1][0] * (maxT2 - minT2);
437 double half2 = (minT2 + maxT2) / 2;
441 result = intersect(minT1, half1, minT2, maxT2) || intersect(half1, maxT1, minT2, maxT2)
442 || intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT1, half2, maxT2);
444 result = intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT1, half2, maxT2)
445 || intersect(minT1, half1, minT2, maxT2) || intersect(half1, maxT1, minT2, maxT2);
|