| /external/skia/experimental/Intersection/ |
| D | CubicConvexHull.cpp | 28 double minT1, minT2, maxT1, maxT2; in intersect() local
29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { in intersect()
36 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
40 split = maxT1 - minT1 > tClipLimit; in intersect()
43 maxT1 = 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
54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); in intersect()
71 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]); in intersect()
73 lineTs.fT[0][0] = interp(minT1, maxT1, lineTs.fT[0][0]); in intersect()
[all …]
|
| D | QuadraticIntersection.cpp | 31 double minT1, minT2, maxT1, maxT2; in intersect() local
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) { in intersect()
41 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
45 split = maxT1 - minT1 > tClipLimit; in intersect()
48 maxT1 = 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
57 bool t1IsLine = maxT1 - minT1 <= quad1Divisions; in intersect()
60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine); in intersect()
64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); in intersect()
[all …]
|
| D | CubicIntersection_Test.cpp | 418 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
421 sub_divide(cubic1, minT1, maxT1, sub1);
429 t1 = minT1 + i.fT[0][0] * (maxT1 - minT1);
436 double half1 = (minT1 + maxT1) / 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
29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { in intersect()
36 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
40 split = maxT1 - minT1 > tClipLimit; in intersect()
43 maxT1 = 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
54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); in intersect()
71 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]); in intersect()
73 lineTs.fT[0][0] = interp(minT1, maxT1, lineTs.fT[0][0]); in intersect()
[all …]
|
| D | QuadraticIntersection.cpp | 31 double minT1, minT2, maxT1, maxT2; in intersect() local
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) { in intersect()
41 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
45 split = maxT1 - minT1 > tClipLimit; in intersect()
48 maxT1 = 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
57 bool t1IsLine = maxT1 - minT1 <= quad1Divisions; in intersect()
60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine); in intersect()
64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); in intersect()
[all …]
|
| D | CubicIntersection_Test.cpp | 418 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
421 sub_divide(cubic1, minT1, maxT1, sub1);
429 t1 = minT1 + i.fT[0][0] * (maxT1 - minT1);
436 double half1 = (minT1 + maxT1) / 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);
|