Searched defs:maxT2 (Results 1 - 6 of 6) sorted by relevance

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicConvexHull.cpp28 double minT1, minT2, maxT1, maxT2; local
32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) {
36 if (maxT1 - minT1 < maxT2 - minT2) {
39 maxT2 = 1;
44 split = (maxT2 - minT2 > tClipLimit) << 1;
46 return chop(minT1, maxT1, minT2, maxT2, split);
51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger);
70 lineTs.fT[0][0] = interp(minT2, maxT2, lineTs.fT[0][0]);
74 lineTs.fT[1][0] = interp(minT2, maxT2, lineT
128 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument
[all...]
H A DQuadraticIntersection.cpp31 double minT1, minT2, maxT1, maxT2; local
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) {
41 if (maxT1 - minT1 < maxT2 - minT2) {
44 maxT2 = 1;
49 split = (maxT2 - minT2 > tClipLimit) << 1;
51 return chop(minT1, maxT1, minT2, maxT2, split);
56 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
58 bool t2IsLine = maxT2 - minT2 <= quad2Divisions;
60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine);
65 sub_divide(quad2, minT2, maxT2, intersection
125 intersectAsLine(double minT1, double maxT1, double minT2, double maxT2, bool treat1AsLine, bool treat2AsLine) argument
221 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument
[all...]
H A DCubicIntersection_Test.cpp418 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);
[all...]
/external/skia/experimental/Intersection/
H A DCubicConvexHull.cpp28 double minT1, minT2, maxT1, maxT2; local
32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) {
36 if (maxT1 - minT1 < maxT2 - minT2) {
39 maxT2 = 1;
44 split = (maxT2 - minT2 > tClipLimit) << 1;
46 return chop(minT1, maxT1, minT2, maxT2, split);
51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger);
70 lineTs.fT[0][0] = interp(minT2, maxT2, lineTs.fT[0][0]);
74 lineTs.fT[1][0] = interp(minT2, maxT2, lineT
128 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument
[all...]
H A DQuadraticIntersection.cpp31 double minT1, minT2, maxT1, maxT2; local
35 if (!bezier_clip(quad1, quad2, minT2, maxT2)) {
41 if (maxT1 - minT1 < maxT2 - minT2) {
44 maxT2 = 1;
49 split = (maxT2 - minT2 > tClipLimit) << 1;
51 return chop(minT1, maxT1, minT2, maxT2, split);
56 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument
58 bool t2IsLine = maxT2 - minT2 <= quad2Divisions;
60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine);
65 sub_divide(quad2, minT2, maxT2, intersection
125 intersectAsLine(double minT1, double maxT1, double minT2, double maxT2, bool treat1AsLine, bool treat2AsLine) argument
221 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument
[all...]
H A DCubicIntersection_Test.cpp418 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);
[all...]

Completed in 106 milliseconds