PathOpsQuadIntersectionTest.cpp revision 8d0a524a4847bc7e1cc63a93b78922739466c201 
1/*
2 * Copyright 2012 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7#include "PathOpsQuadIntersectionTestData.h"
8#include "PathOpsTestCommon.h"
9#include "SkIntersections.h"
10#include "SkPathOpsRect.h"
11#include "SkReduceOrder.h"
12#include "Test.h"
13
14static void standardTestCases(skiatest::Reporter* reporter) {
15    bool showSkipped = false;
16    for (size_t index = 0; index < quadraticTests_count; ++index) {
17        const SkDQuad& quad1 = quadraticTests[index][0];
18        SkASSERT(ValidQuad(quad1));
19        const SkDQuad& quad2 = quadraticTests[index][1];
20        SkASSERT(ValidQuad(quad2));
21        SkReduceOrder reduce1, reduce2;
22        int order1 = reduce1.reduce(quad1, SkReduceOrder::kFill_Style);
23        int order2 = reduce2.reduce(quad2, SkReduceOrder::kFill_Style);
24        if (order1 < 3) {
25            if (showSkipped) {
26                SkDebugf("[%d] quad1 order=%d\n", static_cast<int>(index), order1);
27            }
28        }
29        if (order2 < 3) {
30            if (showSkipped) {
31                SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
32            }
33        }
34        if (order1 == 3 && order2 == 3) {
35            SkIntersections intersections;
36            intersections.intersect(quad1, quad2);
37            if (intersections.used() > 0) {
38                for (int pt = 0; pt < intersections.used(); ++pt) {
39                    double tt1 = intersections[0][pt];
40                    SkDPoint xy1 = quad1.xyAtT(tt1);
41                    double tt2 = intersections[1][pt];
42                    SkDPoint xy2 = quad2.xyAtT(tt2);
43                    if (!xy1.approximatelyEqual(xy2)) {
44                        SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
45                                __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY,
46                                tt2, xy2.fX, xy2.fY);
47                        REPORTER_ASSERT(reporter, 0);
48                    }
49                }
50            }
51        }
52    }
53}
54
55static const SkDQuad testSet[] = {
56    {{{0.647069409,2.97691634}, {0.946860918,3.17625612}, {1.46875407,2.65105457}}},
57    {{{0,1}, {0.723699095,2.82756208}, {1.08907197,2.97497449}}},
58
59    {{{131.37418,11414.9825}, {130.28798,11415.9328}, {130.042755,11417.4131}}},
60    {{{130.585787,11418.4142}, {130.021447,11417.8498}, {130,11417}}},
61
62    {{{130.73167037963867, 11418.546386718750}, {131.26360225677490, 11418.985778808592},
63            {132, 11419 }}},
64    {{{132, 11419}, {131.15012693405151, 11418.978546142578},
65            {130.58578681945801, 11418.414184570313}}},
66
67    {{{132, 11419},
68            {130.73167037963867, 11418.546386718750}, {131.26360225677490, 11418.985778808592}}},
69    {{{131.15012693405151, 11418.978546142578},
70            {130.58578681945801, 11418.414184570313}, {132, 11419}}},
71
72    {{{3.0774019473063863, 3.35198509346713}, {3.0757503498668397, 3.327320623945933},
73            {3.0744102085015879, 3.3025879417907196}}},
74    {{{3.053913680774329, 3.3310471586283938}, {3.0758730889691694, 3.3273466070370152},
75            {3.0975671980059394, 3.3235031316554351}}},
76
77    {{{3.39068129, 4.44939202}, {3.03659239, 3.81843234}, {3.06844529, 3.02100922}}},
78    {{{2.10714698, 3.44196686}, {3.12180288, 3.38575704}, {3.75968569, 3.1281838}}},
79
80    {{{2.74792918, 4.77711896}, {2.82236867, 4.23882547}, {2.82848144, 3.63729341}}},
81    {{{2.62772567, 3.64823958}, {3.46652495, 3.64258364}, {4.1425079, 3.48623815}}},
82
83    {{{1.34375, 2.03125}, {2.2734375, 2.6640625}, {3.25, 3.25}}},
84    {{{3.96875, 4.65625}, {3.3359375, 3.7265625}, {2.75, 2.75}}},
85
86    {{{0, 1}, {0.324417544, 2.27953848}, {0.664376547, 2.58940267}}},
87    {{{1, 2}, {0.62109375, 2.70703125}, {0.640625, 2.546875}}},
88
89    {{{1, 2}, {0.984375, 2.3359375}, {1.0625, 2.15625}}},
90    {{{0, 1}, {0.983539095, 2.30041152}, {1.47325103, 2.61316872}}},
91
92    {{{4.09011926, 2.20971038}, {4.74608133, 1.9335932}, {5.02469918, 2.00694987}}},
93    {{{2.79472921, 1.73568666}, {3.36246373, 1.21251209}, {5, 2}}},
94
95    {{{1.80814127, 2.41537795}, {2.23475077, 2.05922313}, {3.16529668, 1.98358763}}},
96    {{{2.16505631, 2.55782454}, {2.40541285, 2.02193091}, {2.99836023, 1.68247638}}},
97
98    {{{3, 1.875}, {3.375, 1.54296875}, {3.375, 1.421875}}},
99    {{{3.375, 1.421875}, {3.3749999999999996, 1.3007812499999998}, {3, 2}}},
100
101    {{{3.34, 8.98}, {2.83363281, 9.4265625}, {2.83796875, 9.363125}}},
102    {{{2.83796875, 9.363125}, {2.84230469, 9.2996875}, {3.17875, 9.1725}}},
103
104    {{{2.7279999999999998, 3.024}, {2.5600000000000005, 2.5600000000000005},
105            {2.1520000000000001, 1.8560000000000001}}},
106    {{{0.66666666666666652, 1.1481481481481481}, {1.3333333333333326, 1.3333333333333335},
107            {2.6666666666666665, 2.1851851851851851}}},
108
109    {{{2.728, 3.024}, {2.56, 2.56}, {2.152, 1.856}}},
110    {{{0.666666667, 1.14814815}, {1.33333333, 1.33333333}, {2.66666667, 2.18518519}}},
111
112    {{{0.875, 1.5}, {1.03125, 1.11022302e-16}, {1, 0}}},
113    {{{0.875, 0.859375}, {1.6875, 0.73046875}, {2.5, 0.625}}},
114
115    {{{1.64451042, 0.0942001592}, {1.53635465, 0.00152863961}, {1, 0}}},
116    {{{1.27672209, 0.15}, {1.32143477, 9.25185854e-17}, {1, 0}}},
117
118    {{{0, 0}, {0.51851851851851849, 1.0185185185185186}, {1.2592592592592591, 1.9259259259259258}}},
119    {{{1.2592592592592593, 1.9259259259259265}, {0.51851851851851893, 1.0185185185185195}, {0, 0}}},
120
121    {{{1.93281168, 2.58856757}, {2.38543691, 2.7096125}, {2.51967352, 2.34531784}}},
122    {{{2.51967352, 2.34531784}, {2.65263731, 2.00639194}, {3.1212119, 1.98608967}}},
123    {{{2.09544533, 2.51981963}, {2.33331524, 2.25252128}, {2.92003302, 2.39442311}}},
124
125    {{{0.924337655, 1.94072717}, {1.25185043, 1.52836494}, {1.71793901, 1.06149951}}},
126    {{{0.940798831, 1.67439357}, {1.25988251, 1.39778567}, {1.71791672, 1.06650313}}},
127
128    {{{0.924337655, 1.94072717}, {1.39158994, 1.32418496}, {2.14967426, 0.687365435}}},
129    {{{0.940798831, 1.67439357}, {1.48941875, 1.16280321}, {2.47884711, 0.60465921}}},
130
131    {{{1.7465749139282332, 1.9930452039527999}, {1.8320006564080331, 1.859481345189089},
132            {1.8731035127758437, 1.6344055934266613}}},
133    {{{1.8731035127758437, 1.6344055934266613}, {1.89928170345231, 1.5006405518943067},
134            {1.9223833226085514, 1.3495796165215643}}},
135    {{{1.74657491, 1.9930452}, {1.87407679, 1.76762853}, {1.92238332, 1.34957962}}},
136    {{{0.60797907, 1.68776977}, {1.0447864, 1.50810914}, {1.87464474, 1.63655092}}},
137    {{{1.87464474, 1.63655092}, {2.70450308, 1.76499271}, {4, 3}}},
138
139    {{{1.2071879545809394, 0.82163474041730045}, {1.1534203513372994, 0.52790870069930229},
140            {1.0880000000000001, 0.29599999999999982}}},  //t=0.63155333662549329,0.80000000000000004
141    {{{0.33333333333333326, 0.81481481481481488}, {0.63395173631977997, 0.68744136726313931},
142            {1.205684411948591, 0.81344322326274499}}},
143    {{{0.33333333333333326, 0.81481481481481488}, {0.63396444791444551, 0.68743368362444768},
144            {1.205732763658403, 0.81345617746834109}}},  //t=0.33333333333333331, 0.63396444791444551
145    {{{1.205684411948591, 0.81344322326274499}, {1.2057085875611198, 0.81344969999329253},
146            {1.205732763658403, 0.81345617746834109}}},
147
148    {{{1.20718795, 0.82163474}, {1.15342035, 0.527908701}, {1.088, 0.296}}},
149    {{{1.20568441, 0.813443223}, {1.20570859, 0.8134497}, {1.20573276, 0.813456177}}},
150
151    {{{41.5072916, 87.1234036}, {28.2747836, 80.9545395}, {23.5780771, 69.3344126}}},
152    {{{72.9633878, 95.6593007}, {42.7738746, 88.4730382}, {31.1932785, 80.2458029}}},
153
154    {{{31.1663962, 54.7302484}, {31.1662882, 54.7301074}, {31.1663969, 54.7302485}}},
155    {{{26.0404936, 45.4260361}, {27.7887523, 33.1863051}, {40.8833242, 26.0301855}}},
156
157    {{{29.9404074, 49.1672596}, {44.3131071, 45.3915253}, {58.1067559, 59.5061814}}},
158    {{{72.6510251, 64.2972928}, {53.6989659, 60.1862397}, {35.2053722, 44.8391126}}},
159
160    {{{52.14807018377202, 65.012420045148644}, {44.778669050208237, 66.315562705604378},
161            {51.619118408823567, 63.787827046262684}}},
162    {{{30.004993234763383, 93.921296668202288}, {53.384822003076991, 60.732180341802753},
163            {58.652998934338584, 43.111073088306185}}},
164
165    {{{80.897794748143198, 49.236332042718459}, {81.082078218891212, 64.066749904488631},
166            {69.972305057149981, 72.968595519850993}}},
167    {{{72.503745601281395, 32.952320736577882}, {88.030880716061645, 38.137194847810164},
168            {73.193774825517906, 67.773492479591397}}},
169
170    {{{67.426548091427676, 37.993772624988935}, {51.129513170665035, 57.542281234563646},
171            {44.594748190899189, 65.644267382683879}}},
172    {{{61.336508189019057, 82.693132843213675}, {54.825078921449354, 71.663932799212432},
173            {47.727444217558926, 61.4049645128392}}},
174
175    {{{67.4265481, 37.9937726}, {51.1295132, 57.5422812}, {44.5947482, 65.6442674}}},
176    {{{61.3365082, 82.6931328}, {54.8250789, 71.6639328}, {47.7274442, 61.4049645}}},
177
178    {{{53.774852327053594, 53.318060789841951}, {45.787877803416805, 51.393492026284981},
179            {46.703936967162392, 53.06860709822206}}},
180    {{{46.703936967162392, 53.06860709822206}, {47.619996130907957, 54.74372217015916},
181            {53.020051653535361, 48.633140968832024}}},
182
183    {{{50.934805397717923, 51.52391952648901}, {56.803308902971423, 44.246234610627596},
184            {69.776888596721406, 40.166645096692555}}},
185    {{{50.230212796400401, 38.386469101526998}, {49.855620812184917, 38.818990392153609},
186            {56.356567496227363, 47.229909093319407}}},
187
188    {{{36.148792695174222, 70.336952793070424}, {36.141613037691357, 70.711654739870085},
189            {36.154708826402597, 71.088492662905836}}},
190    {{{35.216235592661825, 70.580199617313212}, {36.244476835123969, 71.010897787304074},
191            {37.230244263238326, 71.423156953613102}}},
192
193    // this pair is nearly coincident, and causes the quartic code to produce bad
194    // data. Mathematica doesn't think they touch. Graphically, I can't tell.
195    // it may not be so bad to pretend that they don't touch, if I can detect that
196    {{{369.848602, 145.680267}, {382.360413, 121.298294}, {406.207703, 121.298294}}},
197    {{{369.850525, 145.675964}, {382.362915, 121.29287}, {406.211273, 121.29287}}},
198
199    {{{33.567436351153468, 62.336347586395924}, {35.200980274619084, 65.038561460144479},
200            {36.479571811084995, 67.632178905412445}}},
201    {{{41.349524945572696, 67.886658677862641}, {39.125562529359087, 67.429772735149214},
202            {35.600314083992416, 66.705372160552685}}},
203
204    {{{67.25299631583178, 21.109080184767524}, {43.617595267398613, 33.658034168577529},
205            {33.38371819435676, 44.214192553988745}}},
206    {{{40.476838859398541, 39.543209911285999}, {36.701186108431131, 34.8817994016458},
207            {30.102144288878023, 26.739063172945315}}},
208
209    {{{25.367434474345036, 50.4712103169743}, {17.865013304933097, 37.356741010559439},
210            {16.818988838905465, 37.682915484123129}}},
211    {{{16.818988838905465, 37.682915484123129}, {15.772964372877833, 38.009089957686811},
212            {20.624104547604965, 41.825131596683121}}},
213
214    {{{26.440225044088567, 79.695009812848298}, {26.085525979582247, 83.717928354134784},
215            {27.075079976297072, 84.820633667838905}}},
216    {{{27.075079976297072, 84.820633667838905}, {28.276546859574015, 85.988574184029034},
217            {25.649263209500006, 87.166762066617025}}},
218
219    {{{34.879150914024962, 83.862726601601125}, {35.095810134304429, 83.693473210169543},
220            {35.359284111931586, 83.488069234177502}}},
221    {{{54.503204203015471, 76.094098492518242}, {51.366889541918894, 71.609856061299155},
222            {46.53086955445437, 69.949863036494207}}},
223
224    {{{0, 0}, {1, 0}, {0, 3}}},
225    {{{1, 0}, {0, 1}, {1, 1}}},
226    {{{369.961151, 137.980698}, {383.970093, 121.298294}, {406.213287, 121.298294}}},
227    {{{353.2948, 194.351074}, {353.2948, 173.767563}, {364.167572, 160.819855}}},
228    {{{360.416077, 166.795715}, {370.126831, 147.872162}, {388.635406, 147.872162}}},
229    {{{406.236359, 121.254936}, {409.445679, 121.254936}, {412.975952, 121.789818}}},
230    {{{406.235992, 121.254936}, {425.705902, 121.254936}, {439.71994, 137.087616}}},
231
232    {{{369.8543701171875, 145.66734313964844}, {382.36788940429688, 121.28203582763672},
233            {406.21844482421875, 121.28203582763672}}},
234    {{{369.96469116210938, 137.96672058105469}, {383.97555541992188, 121.28203582763672},
235            {406.2218017578125, 121.28203582763672}}},
236
237    {{{369.962311, 137.976044}, {383.971893, 121.29287}, {406.216125, 121.29287}}},
238
239    {{{400.121704, 149.468719}, {391.949493, 161.037186}, {391.949493, 181.202423}}},
240    {{{391.946747, 181.839218}, {391.946747, 155.62442}, {406.115479, 138.855438}}},
241    {{{360.048828125, 229.2578125}, {360.048828125, 224.4140625}, {362.607421875, 221.3671875}}},
242    {{{362.607421875, 221.3671875}, {365.166015625, 218.3203125}, {369.228515625, 218.3203125}}},
243    {{{8, 8}, {10, 10}, {8, -10}}},
244    {{{8, 8}, {12, 12}, {14, 4}}},
245    {{{8, 8}, {9, 9}, {10, 8}}}
246};
247
248const size_t testSetCount = SK_ARRAY_COUNT(testSet);
249
250static void oneOffTest1(skiatest::Reporter* reporter, size_t outer, size_t inner) {
251    const SkDQuad& quad1 = testSet[outer];
252    SkASSERT(ValidQuad(quad1));
253    const SkDQuad& quad2 = testSet[inner];
254    SkASSERT(ValidQuad(quad2));
255    SkIntersections intersections2;
256    intersections2.intersect(quad1, quad2);
257    for (int pt = 0; pt < intersections2.used(); ++pt) {
258        double tt1 = intersections2[0][pt];
259        SkDPoint xy1 = quad1.xyAtT(tt1);
260        double tt2 = intersections2[1][pt];
261        SkDPoint xy2 = quad2.xyAtT(tt2);
262        if (!xy1.approximatelyEqual(xy2)) {
263            SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
264                    __FUNCTION__, static_cast<int>(outer), static_cast<int>(inner),
265                    tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
266            REPORTER_ASSERT(reporter, 0);
267        }
268#if ONE_OFF_DEBUG
269        SkDebugf("%s [%d][%d] t1=%1.9g (%1.9g, %1.9g) t2=%1.9g\n", __FUNCTION__,
270            outer, inner, tt1, xy1.fX, xy1.fY, tt2);
271#endif
272    }
273}
274
275static void PathOpsQuadIntersectionOneOffTest(skiatest::Reporter* reporter) {
276    oneOffTest1(reporter, 0, 1);
277}
278
279static void oneOffTests(skiatest::Reporter* reporter) {
280    for (size_t outer = 0; outer < testSetCount - 1; ++outer) {
281        for (size_t inner = outer + 1; inner < testSetCount; ++inner) {
282            oneOffTest1(reporter, outer, inner);
283        }
284    }
285}
286
287static const SkDQuad coincidentTestSet[] = {
288    {{{369.850525, 145.675964}, {382.362915, 121.29287}, {406.211273, 121.29287}}},
289    {{{369.850525, 145.675964}, {382.362915, 121.29287}, {406.211273, 121.29287}}},
290    {{{8, 8}, {10, 10}, {8, -10}}},
291    {{{8, -10}, {10, 10}, {8, 8}}},
292};
293
294const size_t coincidentTestSetCount = SK_ARRAY_COUNT(coincidentTestSet);
295
296static void coincidentTest(skiatest::Reporter* reporter) {
297    for (size_t testIndex = 0; testIndex < coincidentTestSetCount - 1; testIndex += 2) {
298        const SkDQuad& quad1 = coincidentTestSet[testIndex];
299        SkASSERT(ValidQuad(quad1));
300        const SkDQuad& quad2 = coincidentTestSet[testIndex + 1];
301        SkASSERT(ValidQuad(quad2));
302        SkIntersections intersections2;
303        intersections2.intersect(quad1, quad2);
304        REPORTER_ASSERT(reporter, intersections2.coincidentUsed() == 2);
305        REPORTER_ASSERT(reporter, intersections2.used() == 2);
306        for (int pt = 0; pt < intersections2.coincidentUsed(); ++pt) {
307            double tt1 = intersections2[0][pt];
308            double tt2 = intersections2[1][pt];
309            REPORTER_ASSERT(reporter, approximately_equal(1, tt1) || approximately_zero(tt1));
310            REPORTER_ASSERT(reporter, approximately_equal(1, tt2) || approximately_zero(tt2));
311        }
312    }
313}
314
315static int floatSign(double x) {
316    return x < 0 ? -1 : x > 0 ? 1 : 0;
317}
318
319static const SkDQuad pointFinderTestSet[] = {
320                                                                                                                                //>=0.633974464         0.633974846 <=
321{{{1.2071879545809394, 0.82163474041730045}, {1.1534203513372994, 0.52790870069930229},
322        {1.0880000000000001, 0.29599999999999982}}},  //t=0.63155333662549329, 0.80000000000000004
323{{{1.2071879545809394, 0.82163474041730045}, {1.2065040319428038, 0.81766753259119995},
324        {1.2058123269101506, 0.81370135061854221}}},  //t=0.63155333662549329, 0.6339049773632347
325{{{1.2058123269101506, 0.81370135061854221}, {1.152376363978022, 0.5244097415381026},
326        {1.0880000000000001, 0.29599999999999982}}},  //t=0.6339049773632347,  0.80000000000000004
327                                                                                                                                //>=0.633974083         0.633975227 <=
328{{{0.33333333333333326, 0.81481481481481488}, {0.63395173631977997, 0.68744136726313931},
329        {1.205684411948591, 0.81344322326274499}}},   //t=0.33333333333333331, 0.63395173631977986
330{{{0.33333333333333326, 0.81481481481481488}, {0.63396444791444551, 0.68743368362444768},
331        {1.205732763658403, 0.81345617746834109}}},   //t=0.33333333333333331, 0.63396444791444551
332{{{1.205684411948591, 0.81344322326274499}, {1.2057085875611198, 0.81344969999329253},
333        {1.205732763658403, 0.81345617746834109}}},   //t=0.63395173631977986, 0.63396444791444551
334{{{1.205732763658403, 0.81345617746834109}, {1.267928895828891, 0.83008534558465619},
335        {1.3333333333333333, 0.85185185185185175}}},  //t=0.63396444791444551, 0.66666666666666663
336};
337
338static void pointFinder(const SkDQuad& q1, const SkDQuad& q2) {
339    for (int index = 0; index < 3; ++index) {
340        double t = q1.nearestT(q2[index]);
341        SkDPoint onQuad = q1.xyAtT(t);
342        SkDebugf("%s t=%1.9g (%1.9g,%1.9g) dist=%1.9g\n", __FUNCTION__, t, onQuad.fX, onQuad.fY,
343                onQuad.distance(q2[index]));
344        double left[3];
345        left[0] = ((const SkDLine&) q1[0]).isLeft(q2[index]);
346        left[1] = ((const SkDLine&) q1[1]).isLeft(q2[index]);
347        SkDLine diag = {{q1[0], q1[2]}};
348        left[2] = diag.isLeft(q2[index]);
349        SkDebugf("%s left=(%d, %d, %d) inHull=%s\n", __FUNCTION__, floatSign(left[0]),
350                floatSign(left[1]), floatSign(left[2]),
351                q1.pointInHull(q2[index]) ? "true" : "false");
352    }
353    SkDebugf("\n");
354}
355
356static void hullIntersect(const SkDQuad& q1, const SkDQuad& q2) {
357    SkDebugf("%s", __FUNCTION__);
358    SkIntersections ts;
359    for (int i1 = 0; i1 < 3; ++i1) {
360        SkDLine l1 = {{q1[i1], q1[(i1 + 1) % 3]}};
361        for (int i2 = 0; i2 < 3; ++i2) {
362            SkDLine l2 = {{q2[i2], q2[(i2 + 1) % 3]}};
363            if (ts.intersect(l1, l2)) {
364                SkDebugf(" [%d,%d]", i1, i2);
365            }
366        }
367    }
368    SkDebugf("\n");
369}
370
371static void QuadraticIntersection_PointFinder() {
372    pointFinder(pointFinderTestSet[0], pointFinderTestSet[4]);
373    pointFinder(pointFinderTestSet[4], pointFinderTestSet[0]);
374    pointFinder(pointFinderTestSet[0], pointFinderTestSet[6]);
375    pointFinder(pointFinderTestSet[6], pointFinderTestSet[0]);
376    hullIntersect(pointFinderTestSet[0], pointFinderTestSet[4]);
377    hullIntersect(pointFinderTestSet[0], pointFinderTestSet[6]);
378}
379
380static void intersectionFinder(int test1, int test2) {
381    const SkDQuad& quad1 = testSet[test1];
382    const SkDQuad& quad2 = testSet[test2];
383
384    double t1Seed = 0.5;
385    double t2Seed = 0.8;
386    double t1Step = 0.1;
387    double t2Step = 0.1;
388    SkDPoint t1[3], t2[3];
389    bool toggle = true;
390    do {
391        t1[0] = quad1.xyAtT(t1Seed - t1Step);
392        t1[1] = quad1.xyAtT(t1Seed);
393        t1[2] = quad1.xyAtT(t1Seed + t1Step);
394        t2[0] = quad2.xyAtT(t2Seed - t2Step);
395        t2[1] = quad2.xyAtT(t2Seed);
396        t2[2] = quad2.xyAtT(t2Seed + t2Step);
397        double dist[3][3];
398        dist[1][1] = t1[1].distance(t2[1]);
399        int best_i = 1, best_j = 1;
400        for (int i = 0; i < 3; ++i) {
401            for (int j = 0; j < 3; ++j) {
402                if (i == 1 && j == 1) {
403                    continue;
404                }
405                dist[i][j] = t1[i].distance(t2[j]);
406                if (dist[best_i][best_j] > dist[i][j]) {
407                    best_i = i;
408                    best_j = j;
409                }
410            }
411        }
412        if (best_i == 0) {
413            t1Seed -= t1Step;
414        } else if (best_i == 2) {
415            t1Seed += t1Step;
416        }
417        if (best_j == 0) {
418            t2Seed -= t2Step;
419        } else if (best_j == 2) {
420            t2Seed += t2Step;
421        }
422        if (best_i == 1 && best_j == 1) {
423            if ((toggle ^= true)) {
424                t1Step /= 2;
425            } else {
426                t2Step /= 2;
427            }
428        }
429    } while (!t1[1].approximatelyEqual(t2[1]));
430    t1Step = t2Step = 0.1;
431    double t10 = t1Seed - t1Step * 2;
432    double t12 = t1Seed + t1Step * 2;
433    double t20 = t2Seed - t2Step * 2;
434    double t22 = t2Seed + t2Step * 2;
435    SkDPoint test;
436    while (!approximately_zero(t1Step)) {
437        test = quad1.xyAtT(t10);
438        t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
439        t1Step /= 2;
440    }
441    t1Step = 0.1;
442    while (!approximately_zero(t1Step)) {
443        test = quad1.xyAtT(t12);
444        t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
445        t1Step /= 2;
446    }
447    while (!approximately_zero(t2Step)) {
448        test = quad2.xyAtT(t20);
449        t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
450        t2Step /= 2;
451    }
452    t2Step = 0.1;
453    while (!approximately_zero(t2Step)) {
454        test = quad2.xyAtT(t22);
455        t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
456        t2Step /= 2;
457    }
458#if ONE_OFF_DEBUG
459    SkDebugf("%s t1=(%1.9g<%1.9g<%1.9g) t2=(%1.9g<%1.9g<%1.9g)\n", __FUNCTION__,
460        t10, t1Seed, t12, t20, t2Seed, t22);
461    SkDPoint p10 = quad1.xyAtT(t10);
462    SkDPoint p1Seed = quad1.xyAtT(t1Seed);
463    SkDPoint p12 = quad1.xyAtT(t12);
464    SkDebugf("%s p1=(%1.9g,%1.9g)<(%1.9g,%1.9g)<(%1.9g,%1.9g)\n", __FUNCTION__,
465        p10.fX, p10.fY, p1Seed.fX, p1Seed.fY, p12.fX, p12.fY);
466    SkDPoint p20 = quad2.xyAtT(t20);
467    SkDPoint p2Seed = quad2.xyAtT(t2Seed);
468    SkDPoint p22 = quad2.xyAtT(t22);
469    SkDebugf("%s p2=(%1.9g,%1.9g)<(%1.9g,%1.9g)<(%1.9g,%1.9g)\n", __FUNCTION__,
470        p20.fX, p20.fY, p2Seed.fX, p2Seed.fY, p22.fX, p22.fY);
471#endif
472}
473
474static void QuadraticIntersection_IntersectionFinder() {
475    intersectionFinder(0, 1);
476}
477
478static void PathOpsQuadIntersectionTest(skiatest::Reporter* reporter) {
479    oneOffTests(reporter);
480    coincidentTest(reporter);
481    standardTestCases(reporter);
482    if (false) QuadraticIntersection_IntersectionFinder();
483    if (false) QuadraticIntersection_PointFinder();
484}
485
486
487#include "TestClassDef.h"
488DEFINE_TESTCLASS_SHORT(PathOpsQuadIntersectionTest)
489
490DEFINE_TESTCLASS_SHORT(PathOpsQuadIntersectionOneOffTest)
491