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