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 "PathOpsCubicIntersectionTestData.h" 8 #include "PathOpsTestCommon.h" 9 #include "SkGeometry.h" 10 #include "SkIntersections.h" 11 #include "SkPathOpsRect.h" 12 #include "SkReduceOrder.h" 13 #include "Test.h" 14 15 const int firstCubicIntersectionTest = 9; 16 17 static void standardTestCases(skiatest::Reporter* reporter) { 18 for (size_t index = firstCubicIntersectionTest; index < tests_count; ++index) { 19 int iIndex = static_cast<int>(index); 20 const SkDCubic& cubic1 = tests[index][0]; 21 const SkDCubic& cubic2 = tests[index][1]; 22 SkReduceOrder reduce1, reduce2; 23 int order1 = reduce1.reduce(cubic1, SkReduceOrder::kNo_Quadratics); 24 int order2 = reduce2.reduce(cubic2, SkReduceOrder::kNo_Quadratics); 25 const bool showSkipped = false; 26 if (order1 < 4) { 27 if (showSkipped) { 28 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, iIndex, order1); 29 } 30 continue; 31 } 32 if (order2 < 4) { 33 if (showSkipped) { 34 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2); 35 } 36 continue; 37 } 38 SkIntersections tIntersections; 39 tIntersections.intersect(cubic1, cubic2); 40 if (!tIntersections.used()) { 41 if (showSkipped) { 42 SkDebugf("%s [%d] no intersection\n", __FUNCTION__, iIndex); 43 } 44 continue; 45 } 46 if (tIntersections.isCoincident(0)) { 47 if (showSkipped) { 48 SkDebugf("%s [%d] coincident\n", __FUNCTION__, iIndex); 49 } 50 continue; 51 } 52 for (int pt = 0; pt < tIntersections.used(); ++pt) { 53 double tt1 = tIntersections[0][pt]; 54 SkDPoint xy1 = cubic1.ptAtT(tt1); 55 double tt2 = tIntersections[1][pt]; 56 SkDPoint xy2 = cubic2.ptAtT(tt2); 57 if (!xy1.approximatelyEqual(xy2)) { 58 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n", 59 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 60 } 61 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 62 } 63 reporter->bumpTestCount(); 64 } 65 } 66 67 static const SkDCubic testSet[] = { 68 // FIXME: uncommenting these two will cause this to fail 69 // this results in two curves very nearly but not exactly coincident 70 #if 0 71 {{{67.426548091427676, 37.993772624988935}, {23.483695892376684, 90.476863174921306}, 72 {35.597065061143162, 79.872482633158796}, {75.38634169631932, 18.244890038969412}}}, 73 {{{67.4265481, 37.9937726}, {23.4836959, 90.4768632}, {35.5970651, 79.8724826}, 74 {75.3863417, 18.24489}}}, 75 #endif 76 77 {{{0, 0}, {0, 1}, {1, 1}, {1, 0}}}, 78 {{{1, 0}, {0, 0}, {0, 1}, {1, 1}}}, 79 80 {{{0, 1}, {4, 5}, {1, 0}, {5, 3}}}, 81 {{{0, 1}, {3, 5}, {1, 0}, {5, 4}}}, 82 83 {{{0, 1}, {1, 6}, {1, 0}, {1, 0}}}, 84 {{{0, 1}, {0, 1}, {1, 0}, {6, 1}}}, 85 86 {{{0, 1}, {3, 4}, {1, 0}, {5, 1}}}, 87 {{{0, 1}, {1, 5}, {1, 0}, {4, 3}}}, 88 89 {{{0, 1}, {1, 2}, {1, 0}, {6, 1}}}, 90 {{{0, 1}, {1, 6}, {1, 0}, {2, 1}}}, 91 92 {{{0, 1}, {0, 5}, {1, 0}, {4, 0}}}, 93 {{{0, 1}, {0, 4}, {1, 0}, {5, 0}}}, 94 95 {{{0, 1}, {3, 4}, {1, 0}, {3, 0}}}, 96 {{{0, 1}, {0, 3}, {1, 0}, {4, 3}}}, 97 98 {{{0, 0}, {1, 2}, {3, 4}, {4, 4}}}, 99 {{{0, 0}, {1, 2}, {3, 4}, {4, 4}}}, 100 {{{4, 4}, {3, 4}, {1, 2}, {0, 0}}}, 101 102 {{{0, 1}, {2, 3}, {1, 0}, {1, 0}}}, 103 {{{0, 1}, {0, 1}, {1, 0}, {3, 2}}}, 104 105 {{{0, 2}, {0, 1}, {1, 0}, {1, 0}}}, 106 {{{0, 1}, {0, 1}, {2, 0}, {1, 0}}}, 107 108 {{{0, 1}, {0, 2}, {1, 0}, {1, 0}}}, 109 {{{0, 1}, {0, 1}, {1, 0}, {2, 0}}}, 110 111 {{{0, 1}, {1, 6}, {1, 0}, {2, 0}}}, 112 {{{0, 1}, {0, 2}, {1, 0}, {6, 1}}}, 113 114 {{{0, 1}, {5, 6}, {1, 0}, {1, 0}}}, 115 {{{0, 1}, {0, 1}, {1, 0}, {6, 5}}}, 116 117 {{{95.837747722788592, 45.025976907939643}, {16.564570095652982, 0.72959763963222402}, 118 {63.209855865319199, 68.047528419665767}, {57.640240647662544, 59.524565264361243}}}, 119 {{{51.593891741518817, 38.53849970667553}, {62.34752929878772, 74.924924725166022}, 120 {74.810149322641152, 34.17966562983564}, {29.368398119401373, 94.66719277886078}}}, 121 122 {{{39.765160968417838, 33.060396198677083}, {5.1922921581157908, 66.854301452103215}, 123 {31.619281802149157, 25.269248720849514}, {81.541621071073038, 70.025341524754353}}}, 124 {{{46.078911165743556, 48.259962651999651}, {20.24450549867214, 49.403916182650214}, 125 {0.26325131778756683, 24.46489805563581}, {15.915006546264051, 83.515023059917155}}}, 126 127 {{{65.454505973241524, 93.881892270353575}, {45.867360264932437, 92.723972719499827}, 128 {2.1464054482739447, 74.636369140183717}, {33.774068594804994, 40.770872887582925}}}, 129 {{{72.963387832494163, 95.659300729473728}, {11.809496633619768, 82.209921247423594}, 130 {13.456139067865974, 57.329313623406605}, {36.060621606214262, 70.867335643091849}}}, 131 132 {{{32.484981432782945, 75.082940782924624}, {42.467313093350882, 48.131159948246157}, 133 {3.5963115764764657, 43.208665839959245}, {79.442476890721579, 89.709102357602262}}}, 134 {{{18.98573861410177, 93.308887208490106}, {40.405250173250792, 91.039661826118675}, 135 {8.0467721950480584, 42.100282172719147}, {40.883324221187891, 26.030185504830527}}}, 136 137 {{{7.5374809128872498, 82.441702896003477}, {22.444346930107265, 22.138854312775123}, 138 {66.76091829629658, 50.753805856571446}, {78.193478508942519, 97.7932997968948}}}, 139 {{{97.700573130371311, 53.53260215070685}, {87.72443481149358, 84.575876772671876}, 140 {19.215031396232092, 47.032676472809484}, {11.989686410869325, 10.659507480757082}}}, 141 142 {{{26.192053931854691, 9.8504326817814416}, {10.174241480498686, 98.476562741434464}, 143 {21.177712558385782, 33.814968789841501}, {75.329030899018534, 55.02231980442177}}}, 144 {{{56.222082700683771, 24.54395039218662}, {95.589995289030483, 81.050822735322086}, 145 {28.180450866082897, 28.837706255185282}, {60.128952916771617, 87.311672180570511}}}, 146 147 {{{42.449716172390481, 52.379709366885805}, {27.896043159019225, 48.797373636065686}, 148 {92.770268299044233, 89.899302036454571}, {12.102066544863426, 99.43241951960718}}}, 149 {{{45.77532924980639, 45.958701495993274}, {37.458701356062065, 68.393691335056758}, 150 {37.569326692060258, 27.673713456687381}, {60.674866037757539, 62.47349659096146}}}, 151 152 {{{67.426548091427676, 37.993772624988935}, {23.483695892376684, 90.476863174921306}, 153 {35.597065061143162, 79.872482633158796}, {75.38634169631932, 18.244890038969412}}}, 154 {{{61.336508189019057, 82.693132843213675}, {44.639380902349664, 54.074825790745592}, 155 {16.815615499771951, 20.049704667203923}, {41.866884958868326, 56.735503699973002}}}, 156 157 {{{18.1312339, 31.6473732}, {95.5711034, 63.5350219}, {92.3283165, 62.0158945}, 158 {18.5656052, 32.1268808}}}, 159 {{{97.402018, 35.7169972}, {33.1127443, 25.8935163}, {1.13970027, 54.9424981}, 160 {56.4860195, 60.529264}}}, 161 }; 162 163 const int testSetCount = (int) SK_ARRAY_COUNT(testSet); 164 165 static const SkDCubic newTestSet[] = { 166 {{{1,3}, {-1.0564518,1.79032254}, {1.45265341,0.229448318}, {1.45381773,0.22913377}}}, 167 {{{1.45381773,0.22913377}, {1.45425761,0.229014933}, {1.0967741,0.451612949}, {0,1}}}, 168 169 {{{1.64551306f, 3.57876182f}, {0.298127174f, 3.70454836f}, {-0.809808373f, 6.39524937f}, {-3.66666651f, 13.333334f}}}, 170 {{{1, 2}, {1, 2}, {-3.66666651f, 13.333334f}, {5, 6}}}, 171 172 {{{0.0660428554,1.65340209}, {-0.251940489,1.43560803}, {-0.782382965,-0.196299091}, {3.33333325,-0.666666627}}}, 173 {{{1,3}, {-1.22353387,1.09411383}, {0.319867611,0.12996155}, {0.886705518,0.107543148}}}, 174 175 {{{-0.13654758,2.10514426}, {-0.585797966,1.89349782}, {-0.807703257,-0.192306399}, {6,-1}}}, 176 {{{1,4}, {-2.25000453,1.42241001}, {1.1314013,0.0505309105}, {1.87140274,0.0363764353}}}, 177 178 {{{1.3127951622009277, 2.0637707710266113}, {1.8210518360137939, 1.9148571491241455}, {1.6106204986572266, -0.68700540065765381}, {8.5, -2.5}}}, 179 {{{3, 4}, {0.33333325386047363, 1.3333332538604736}, {3.6666667461395264, -0.66666674613952637}, {3.6666665077209473, -0.66666656732559204}}}, 180 181 {{{980.026001,1481.276}, {980.026001,1481.276}, {980.02594,1481.27576}, {980.025879,1481.27527}}}, 182 {{{980.025879,1481.27527}, {980.025452,1481.27222}, {980.023743,1481.26038}, {980.02179,1481.24072}}}, 183 184 {{{1.80943513,3.07782435}, {1.66686702,2.16806936}, {1.68301272,0}, {3,0}}}, 185 {{{0,1}, {0,3}, {3,2}, {5,2}}}, 186 187 {{{3.4386673,2.66977954}, {4.06668949,2.17046738}, {4.78887367,1.59629118}, {6,2}}}, 188 {{{1.71985495,3.49467373}, {2.11620402,2.7201426}, {2.91897964,1.15138781}, {6,3}}}, 189 190 {{{0,1}, {0.392703831,1.78540766}, {0.219947904,2.05676103}, {0.218561709,2.05630541}}}, 191 {{{0.218561709,2.05630541}, {0.216418028,2.05560064}, {0.624105453,1.40486407}, {4.16666651,1.00000012}}}, 192 193 {{{0, 1}, {3, 5}, {2, 1}, {3, 1}}}, 194 {{{1.01366711f, 2.21379328f}, {1.09074128f, 2.23241305f}, {1.60246587f, 0.451849401f}, {5, 3}}}, 195 196 {{{0, 1}, {0.541499972f, 3.16599989f}, {1.08299994f, 2.69299984f}, {2.10083938f, 1.80391729f}}}, 197 {{{0.806384504f, 2.85426903f}, {1.52740121f, 1.99355423f}, {2.81689167f, 0.454222918f}, {5, 1}}}, 198 199 {{{0, 1}, {1.90192389f, 2.90192389f}, {2.59807634f, 2.79422879f}, {3.1076951f, 2.71539044f}}}, 200 {{{2, 3}, {2.36602545f, 3.36602545f}, {2.330127f, 3.06217766f}, {2.28460979f, 2.67691422f}}}, 201 202 {{{0, 1}, {1.90192389f, 2.90192389f}, {2.59807634f, 2.79422879f}, {3.1076951f, 2.71539044f}}}, 203 {{{2.28460979f, 2.67691422f}, {2.20577145f, 2.00961876f}, {2.09807634f, 1.09807622f}, {4, 3}}}, 204 205 {{{0, 1}, {0.8211091160774231, 2.0948121547698975}, {0.91805583238601685, 2.515404224395752}, {0.91621249914169312, 2.5146586894989014}}}, 206 {{{0.91621249914169312, 2.5146586894989014}, {0.91132104396820068, 2.5126807689666748}, {0.21079301834106445, -0.45617169141769409}, {10.5, -1.6666665077209473}}}, 207 208 {{{42.6237564,68.9841232}, {32.449646,81.963089}, {14.7713947,103.565269}, {12.6310005,105.247002}}}, 209 {{{37.2640038,95.3540039}, {37.2640038,95.3540039}, {11.3710003,83.7339935}, {-25.0779991,124.912003}}}, 210 211 {{{0,1}, {4,5}, {6,0}, {1,0}}}, 212 {{{0,6}, {0,1}, {1,0}, {5,4}}}, 213 214 {{{0,1}, {4,6}, {5,1}, {6,2}}}, 215 {{{1,5}, {2,6}, {1,0}, {6,4}}}, 216 217 {{{322, 896.04803466796875}, {314.09201049804687, 833.4376220703125}, {260.24713134765625, 785}, {195, 785}}}, 218 {{{195, 785}, {265.14016723632812, 785}, {322, 842.30755615234375}, {322, 913}}}, 219 220 {{{1, 4}, {4, 5}, {3, 2}, {6, 3}}}, 221 {{{2, 3}, {3, 6}, {4, 1}, {5, 4}}}, 222 223 {{{67, 913}, {67, 917.388916015625}, {67.224380493164063, 921.72576904296875}, {67.662384033203125, 926}}}, 224 {{{194, 1041}, {123.85984039306641, 1041}, {67, 983.69244384765625}, {67, 913}}}, 225 226 {{{1,4}, {1,5}, {6,0}, {5,1}}}, 227 {{{0,6}, {1,5}, {4,1}, {5,1}}}, 228 229 {{{0,1}, {4,5}, {6,0}, {1,0}}}, 230 {{{0,6}, {0,1}, {1,0}, {5,4}}}, 231 232 {{{0,1}, {4,6}, {2,0}, {2,0}}}, 233 {{{0,2}, {0,2}, {1,0}, {6,4}}}, 234 235 {{{980.9000244140625, 1474.3280029296875}, {980.9000244140625, 1474.3280029296875}, {978.89300537109375, 1471.95703125}, {981.791015625, 1469.487060546875}}}, 236 {{{981.791015625, 1469.487060546875}, {981.791015625, 1469.4859619140625}, {983.3580322265625, 1472.72900390625}, {980.9000244140625, 1474.3280029296875}}}, 237 238 {{{275,532}, {277.209137,532}, {279,530.209106}, {279,528}}}, 239 {{{278,529}, {278,530.65686}, {276.65686,532}, {275,532}}}, 240 241 #if 0 // FIXME: asserts coincidence, not working yet 242 {{{195, 785}, {124.30755615234375, 785}, {67, 841.85986328125}, {67, 912}}}, 243 {{{67, 913}, {67, 842.30755615234375}, {123.85984039306641, 785}, {194, 785}}}, 244 #endif 245 246 {{{149,710.001465}, {149.000809,712.209961}, {150.791367,714}, {153,714}}}, 247 {{{154,715}, {151.238571,715}, {149,712.761414}, {149,710}}}, 248 249 {{{1,2}, {1,2}, {2,0}, {6,0}}}, 250 {{{0,2}, {0,6}, {2,1}, {2,1}}}, 251 252 {{{0,1}, {2,3}, {5,1}, {4,3}}}, 253 {{{1,5}, {3,4}, {1,0}, {3,2}}}, 254 255 {{{399,657}, {399,661.970581}, {403.029449,666}, {408,666}}}, 256 {{{406,666}, {402.686279,666}, {400,663.313721}, {400,660}}}, 257 258 {{{0,5}, {3,5}, {3,0}, {3,2}}}, 259 {{{0,3}, {2,3}, {5,0}, {5,3}}}, 260 261 {{{132, 11419}, {130.89543151855469, 11419}, {130, 11418.1044921875}, {130, 11417}}}, 262 263 {{{3, 4}, {1, 5}, {4, 3}, {6, 4}}}, 264 {{{3, 4}, {4, 6}, {4, 3}, {5, 1}}}, 265 266 {{{130.04275512695312, 11417.413085937500 }, 267 {130.23312377929687, 11418.319335937500 }, 268 {131.03707885742187, 11419.000000000000 }, 269 {132.00000000000000, 11419.000000000000 }}}, 270 271 {{{132.00000000000000, 11419.000000000000 }, 272 {130.89543151855469, 11419.000000000000 }, 273 {130.00000000000000, 11418.104492187500 }, 274 {130.00000000000000, 11417.000000000000 }}}, 275 276 {{{1.0516976506771041, 2.9684399028541346 }, 277 {1.0604363140895228, 2.9633503074444141 }, 278 {1.0692548215065762, 2.9580354426587459 }, 279 {1.0781560339512140, 2.9525043684031349 }}}, 280 281 {{{1.0523038101345104, 2.9523755204833737 }, 282 {1.0607035288264237, 2.9580853881628375 }, 283 {1.0690530472271964, 2.9633896794787749 }, 284 {1.0773566568712512, 2.9682969775000219 }}}, 285 286 {{{1.0386522625066592, 2.9759024812329078 }, 287 {1.0559713690392631, 2.9661782500838885 }, 288 {1.0736041309019990, 2.9555348259177858 }, 289 {1.0915734362784633, 2.9440446879826569 }}}, 290 291 {{{1.0396670794879301, 2.9435062123457261 }, 292 {1.0565690546812769, 2.9557413250983462 }, 293 {1.0732616463413533, 2.9663369676594282 }, 294 {1.0897791867435489, 2.9753618045797472 }}}, 295 296 {{{0.8685656183311091, 3.0409266475785208 }, 297 {0.99189542936395292, 3.0212163698184424 }, 298 {1.1302108367493320, 2.9265646471747306 }, 299 {1.2952305904872474, 2.7940808546473788 }}}, 300 301 {{{0.85437872843682727, 2.7536036928549055 }, 302 {1.0045584590592620, 2.9493041024831705 }, 303 {1.1336998329885613, 3.0248027987251747 }, 304 {1.2593809752247314, 3.0152560315809107 }}}, 305 306 {{{0, 1}, {1, 6}, {1, 0}, {6, 2}}}, 307 {{{0, 1}, {2, 6}, {1, 0}, {6, 1}}}, 308 309 {{{134,11414}, {131.990234375,11414}, {130.32666015625,11415.482421875}, {130.04275512695312,11417.4130859375}}}, 310 {{{132,11419}, {130.89543151855469,11419}, {130,11418.1044921875}, {130,11417}}}, 311 312 {{{132,11419}, {130.89543151855469,11419}, {130,11418.1044921875}, {130,11417}}}, 313 {{{130.04275512695312,11417.4130859375}, {130.23312377929687,11418.3193359375}, {131.03707885742187,11419}, {132,11419}}}, 314 315 {{{0, 1}, {2, 3}, {5, 1}, {4, 3}}}, 316 {{{1, 5}, {3, 4}, {1, 0}, {3, 2}}}, 317 318 {{{3, 5}, {1, 6}, {5, 0}, {3, 1}}}, 319 {{{0, 5}, {1, 3}, {5, 3}, {6, 1}}}, 320 321 {{{0, 1}, {1, 5}, {1, 0}, {1, 0}}}, 322 {{{0, 1}, {0, 1}, {1, 0}, {5, 1}}}, 323 324 {{{1, 3}, {5, 6}, {5, 3}, {5, 4}}}, 325 {{{3, 5}, {4, 5}, {3, 1}, {6, 5}}}, 326 327 {{{0, 5}, {0, 5}, {5, 4}, {6, 4}}}, 328 {{{4, 5}, {4, 6}, {5, 0}, {5, 0}}}, 329 330 {{{0, 4}, {1, 3}, {5, 4}, {4, 2}}}, 331 {{{4, 5}, {2, 4}, {4, 0}, {3, 1}}}, 332 333 {{{0, 2}, {1, 5}, {3, 2}, {4, 1}}}, 334 {{{2, 3}, {1, 4}, {2, 0}, {5, 1}}}, 335 336 {{{0, 2}, {2, 3}, {5, 1}, {3, 2}}}, 337 {{{1, 5}, {2, 3}, {2, 0}, {3, 2}}}, 338 339 {{{2, 6}, {4, 5}, {1, 0}, {6, 1}}}, 340 {{{0, 1}, {1, 6}, {6, 2}, {5, 4}}}, 341 342 {{{0, 1}, {1, 2}, {6, 5}, {5, 4}}}, 343 {{{5, 6}, {4, 5}, {1, 0}, {2, 1}}}, 344 345 {{{2.5119999999999996, 1.5710000000000002}, {2.6399999999999983, 1.6599999999999997}, 346 {2.8000000000000007, 1.8000000000000003}, {3, 2}}}, 347 {{{2.4181876227114887, 1.9849772580462195}, {2.8269904869227211, 2.009330650246834}, 348 {3.2004679292461624, 1.9942047174679169}, {3.4986199496818058, 2.0035994597094731}}}, 349 350 {{{2, 3}, {1, 4}, {1, 0}, {6, 0}}}, 351 {{{0, 1}, {0, 6}, {3, 2}, {4, 1}}}, 352 353 {{{0, 2}, {1, 5}, {1, 0}, {6, 1}}}, 354 {{{0, 1}, {1, 6}, {2, 0}, {5, 1}}}, 355 356 {{{0, 1}, {1, 5}, {2, 1}, {4, 0}}}, 357 {{{1, 2}, {0, 4}, {1, 0}, {5, 1}}}, 358 359 {{{0, 1}, {3, 5}, {2, 1}, {3, 1}}}, 360 {{{1, 2}, {1, 3}, {1, 0}, {5, 3}}}, 361 362 {{{0, 1}, {2, 5}, {6, 0}, {5, 3}}}, 363 {{{0, 6}, {3, 5}, {1, 0}, {5, 2}}}, 364 365 {{{0, 1}, {3, 6}, {1, 0}, {5, 2}}}, 366 {{{0, 1}, {2, 5}, {1, 0}, {6, 3}}}, 367 368 {{{1, 2}, {5, 6}, {1, 0}, {1, 0}}}, 369 {{{0, 1}, {0, 1}, {2, 1}, {6, 5}}}, 370 371 {{{0, 6}, {1, 2}, {1, 0}, {1, 0}}}, 372 {{{0, 1}, {0, 1}, {6, 0}, {2, 1}}}, 373 374 {{{0, 2}, {0, 1}, {3, 0}, {1, 0}}}, 375 {{{0, 3}, {0, 1}, {2, 0}, {1, 0}}}, 376 }; 377 378 const int newTestSetCount = (int) SK_ARRAY_COUNT(newTestSet); 379 static void oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, 380 bool coin) { 381 SkASSERT(ValidCubic(cubic1)); 382 SkASSERT(ValidCubic(cubic2)); 383 #if ONE_OFF_DEBUG 384 SkDebugf("computed quadratics given\n"); 385 SkDebugf(" {{%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", 386 cubic1[0].fX, cubic1[0].fY, cubic1[1].fX, cubic1[1].fY, 387 cubic1[2].fX, cubic1[2].fY, cubic1[3].fX, cubic1[3].fY); 388 SkDebugf(" {{%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", 389 cubic2[0].fX, cubic2[0].fY, cubic2[1].fX, cubic2[1].fY, 390 cubic2[2].fX, cubic2[2].fY, cubic2[3].fX, cubic2[3].fY); 391 #endif 392 SkIntersections intersections; 393 intersections.intersect(cubic1, cubic2); 394 #if DEBUG_T_SECT_DUMP == 3 395 SkDebugf("</div>\n\n"); 396 SkDebugf("<script type=\"text/javascript\">\n\n"); 397 SkDebugf("var testDivs = [\n"); 398 for (int index = 1; index <= gDumpTSectNum; ++index) { 399 SkDebugf("sect%d,\n", index); 400 } 401 #endif 402 if (coin && intersections.used() != 2) { 403 SkDebugf(""); 404 } 405 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2); 406 double tt1, tt2; 407 SkDPoint xy1, xy2; 408 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { 409 tt1 = intersections[0][pt3]; 410 xy1 = cubic1.ptAtT(tt1); 411 tt2 = intersections[1][pt3]; 412 xy2 = cubic2.ptAtT(tt2); 413 const SkDPoint& iPt = intersections.pt(pt3); 414 #if ONE_OFF_DEBUG 415 SkDebugf("%s t1=%1.9g (%1.9g, %1.9g) (%1.9g, %1.9g) (%1.9g, %1.9g) t2=%1.9g\n", 416 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, 417 iPt.fY, xy2.fX, xy2.fY, tt2); 418 #endif 419 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); 420 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); 421 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 422 } 423 reporter->bumpTestCount(); 424 } 425 426 static void oneOff(skiatest::Reporter* reporter, int outer, int inner) { 427 const SkDCubic& cubic1 = testSet[outer]; 428 const SkDCubic& cubic2 = testSet[inner]; 429 oneOff(reporter, cubic1, cubic2, false); 430 } 431 432 static void newOneOff(skiatest::Reporter* reporter, int outer, int inner) { 433 const SkDCubic& cubic1 = newTestSet[outer]; 434 const SkDCubic& cubic2 = newTestSet[inner]; 435 oneOff(reporter, cubic1, cubic2, false); 436 } 437 438 static void oneOffTests(skiatest::Reporter* reporter) { 439 for (int outer = 0; outer < testSetCount - 1; ++outer) { 440 for (int inner = outer + 1; inner < testSetCount; ++inner) { 441 oneOff(reporter, outer, inner); 442 } 443 } 444 for (int outer = 0; outer < newTestSetCount - 1; ++outer) { 445 for (int inner = outer + 1; inner < newTestSetCount; ++inner) { 446 newOneOff(reporter, outer, inner); 447 } 448 } 449 } 450 451 #define DEBUG_CRASH 0 452 453 static void CubicIntersection_RandTest(skiatest::Reporter* reporter) { 454 srand(0); 455 const int tests = 10000000; 456 #if !defined(SK_BUILD_FOR_WIN) && !defined(SK_BUILD_FOR_ANDROID) 457 unsigned seed = 0; 458 #endif 459 for (int test = 0; test < tests; ++test) { 460 SkDCubic cubic1, cubic2; 461 for (int i = 0; i < 4; ++i) { 462 cubic1[i].fX = static_cast<double>(SK_RAND(seed)) / RAND_MAX * 100; 463 cubic1[i].fY = static_cast<double>(SK_RAND(seed)) / RAND_MAX * 100; 464 cubic2[i].fX = static_cast<double>(SK_RAND(seed)) / RAND_MAX * 100; 465 cubic2[i].fY = static_cast<double>(SK_RAND(seed)) / RAND_MAX * 100; 466 } 467 #if DEBUG_CRASH 468 char str[1024]; 469 snprintf(str, sizeof(str), 470 "{{{%1.9g, %1.9g}, {%1.9g, %1.9g}, {%1.9g, %1.9g}, {%1.9g, %1.9g}}},\n" 471 "{{{%1.9g, %1.9g}, {%1.9g, %1.9g}, {%1.9g, %1.9g}, {%1.9g, %1.9g}}},\n", 472 cubic1[0].fX, cubic1[0].fY, cubic1[1].fX, cubic1[1].fY, cubic1[2].fX, cubic1[2].fY, 473 cubic1[3].fX, cubic1[3].fY, 474 cubic2[0].fX, cubic2[0].fY, cubic2[1].fX, cubic2[1].fY, cubic2[2].fX, cubic2[2].fY, 475 cubic2[3].fX, cubic2[3].fY); 476 #endif 477 SkDRect rect1, rect2; 478 rect1.setBounds(cubic1); 479 rect2.setBounds(cubic2); 480 bool boundsIntersect = rect1.fLeft <= rect2.fRight && rect2.fLeft <= rect2.fRight 481 && rect1.fTop <= rect2.fBottom && rect2.fTop <= rect1.fBottom; 482 if (test == -1) { 483 SkDebugf("ready...\n"); 484 } 485 SkIntersections intersections2; 486 int newIntersects = intersections2.intersect(cubic1, cubic2); 487 if (!boundsIntersect && newIntersects) { 488 #if DEBUG_CRASH 489 SkDebugf("%s %d unexpected intersection boundsIntersect=%d " 490 " newIntersects=%d\n%s %s\n", __FUNCTION__, test, boundsIntersect, 491 newIntersects, __FUNCTION__, str); 492 #endif 493 REPORTER_ASSERT(reporter, 0); 494 } 495 for (int pt = 0; pt < intersections2.used(); ++pt) { 496 double tt1 = intersections2[0][pt]; 497 SkDPoint xy1 = cubic1.ptAtT(tt1); 498 double tt2 = intersections2[1][pt]; 499 SkDPoint xy2 = cubic2.ptAtT(tt2); 500 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 501 } 502 reporter->bumpTestCount(); 503 } 504 } 505 506 static void intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, 507 double t1Step, double t2Step) { 508 const SkDCubic& cubic1 = newTestSet[index0]; 509 const SkDCubic& cubic2 = newTestSet[index1]; 510 SkDPoint t1[3], t2[3]; 511 bool toggle = true; 512 do { 513 t1[0] = cubic1.ptAtT(t1Seed - t1Step); 514 t1[1] = cubic1.ptAtT(t1Seed); 515 t1[2] = cubic1.ptAtT(t1Seed + t1Step); 516 t2[0] = cubic2.ptAtT(t2Seed - t2Step); 517 t2[1] = cubic2.ptAtT(t2Seed); 518 t2[2] = cubic2.ptAtT(t2Seed + t2Step); 519 double dist[3][3]; 520 dist[1][1] = t1[1].distance(t2[1]); 521 int best_i = 1, best_j = 1; 522 for (int i = 0; i < 3; ++i) { 523 for (int j = 0; j < 3; ++j) { 524 if (i == 1 && j == 1) { 525 continue; 526 } 527 dist[i][j] = t1[i].distance(t2[j]); 528 if (dist[best_i][best_j] > dist[i][j]) { 529 best_i = i; 530 best_j = j; 531 } 532 } 533 } 534 if (best_i == 0) { 535 t1Seed -= t1Step; 536 } else if (best_i == 2) { 537 t1Seed += t1Step; 538 } 539 if (best_j == 0) { 540 t2Seed -= t2Step; 541 } else if (best_j == 2) { 542 t2Seed += t2Step; 543 } 544 if (best_i == 1 && best_j == 1) { 545 if ((toggle ^= true)) { 546 t1Step /= 2; 547 } else { 548 t2Step /= 2; 549 } 550 } 551 } while (!t1[1].approximatelyEqual(t2[1])); 552 t1Step = t2Step = 0.1; 553 double t10 = t1Seed - t1Step * 2; 554 double t12 = t1Seed + t1Step * 2; 555 double t20 = t2Seed - t2Step * 2; 556 double t22 = t2Seed + t2Step * 2; 557 SkDPoint test; 558 while (!approximately_zero(t1Step)) { 559 test = cubic1.ptAtT(t10); 560 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step; 561 t1Step /= 2; 562 } 563 t1Step = 0.1; 564 while (!approximately_zero(t1Step)) { 565 test = cubic1.ptAtT(t12); 566 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; 567 t1Step /= 2; 568 } 569 while (!approximately_zero(t2Step)) { 570 test = cubic2.ptAtT(t20); 571 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step; 572 t2Step /= 2; 573 } 574 t2Step = 0.1; 575 while (!approximately_zero(t2Step)) { 576 test = cubic2.ptAtT(t22); 577 t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step; 578 t2Step /= 2; 579 } 580 #if ONE_OFF_DEBUG 581 SkDebugf("%s t1=(%1.9g<%1.9g<%1.9g) t2=(%1.9g<%1.9g<%1.9g)\n", __FUNCTION__, 582 t10, t1Seed, t12, t20, t2Seed, t22); 583 SkDPoint p10 = cubic1.ptAtT(t10); 584 SkDPoint p1Seed = cubic1.ptAtT(t1Seed); 585 SkDPoint p12 = cubic1.ptAtT(t12); 586 SkDebugf("%s p1=(%1.9g,%1.9g)<(%1.9g,%1.9g)<(%1.9g,%1.9g)\n", __FUNCTION__, 587 p10.fX, p10.fY, p1Seed.fX, p1Seed.fY, p12.fX, p12.fY); 588 SkDPoint p20 = cubic2.ptAtT(t20); 589 SkDPoint p2Seed = cubic2.ptAtT(t2Seed); 590 SkDPoint p22 = cubic2.ptAtT(t22); 591 SkDebugf("%s p2=(%1.9g,%1.9g)<(%1.9g,%1.9g)<(%1.9g,%1.9g)\n", __FUNCTION__, 592 p20.fX, p20.fY, p2Seed.fX, p2Seed.fY, p22.fX, p22.fY); 593 #endif 594 } 595 596 static void CubicIntersection_IntersectionFinder() { 597 // double t1Seed = 0.87; 598 // double t2Seed = 0.87; 599 double t1Step = 0.000001; 600 double t2Step = 0.000001; 601 intersectionFinder(0, 1, 0.855895664, 0.864850875, t1Step, t2Step); 602 intersectionFinder(0, 1, 0.865207906, 0.865207887, t1Step, t2Step); 603 intersectionFinder(0, 1, 0.865213351, 0.865208087, t1Step, t2Step); 604 } 605 606 static const SkDCubic selfSet[] = { 607 {{{2, 3}, {0, 4}, {3, 2}, {5, 3}}}, 608 {{{3, 6}, {2, 3}, {4, 0}, {3, 2}}}, 609 {{{0, 2}, {2, 3}, {5, 1}, {3, 2}}}, 610 {{{0, 2}, {3, 5}, {5, 0}, {4, 2}}}, 611 {{{3.34, 8.98}, {1.95, 10.27}, {3.76, 7.65}, {4.96, 10.64}}}, 612 {{{3.13, 2.74}, {1.08, 4.62}, {3.71, 0.94}, {2.01, 3.81}}}, 613 {{{6.71, 3.14}, {7.99, 2.75}, {8.27, 1.96}, {6.35, 3.57}}}, 614 {{{12.81, 7.27}, {7.22, 6.98}, {12.49, 8.97}, {11.42, 6.18}}}, 615 }; 616 617 int selfSetCount = (int) SK_ARRAY_COUNT(selfSet); 618 619 static void selfOneOff(skiatest::Reporter* reporter, int index) { 620 const SkDCubic& cubic = selfSet[index]; 621 SkPoint c[4]; 622 for (int i = 0; i < 4; ++i) { 623 c[i] = cubic[i].asSkPoint(); 624 } 625 SkScalar loopT; 626 SkScalar d[3]; 627 SkCubicType cubicType = SkClassifyCubic(c, d); 628 SkDCubic::CubicType dType; 629 if (SkDCubic::ComplexBreak(c, &loopT, &dType) && cubicType == SkCubicType::kLoop_SkCubicType) { 630 SkIntersections i; 631 SkPoint twoCubics[7]; 632 SkChopCubicAt(c, twoCubics, loopT); 633 SkDCubic chopped[2]; 634 chopped[0].set(&twoCubics[0]); 635 chopped[1].set(&twoCubics[3]); 636 int result = i.intersect(chopped[0], chopped[1]); 637 REPORTER_ASSERT(reporter, result == 2); 638 REPORTER_ASSERT(reporter, i.used() == 2); 639 for (int index = 0; index < result; ++index) { 640 SkDPoint pt1 = chopped[0].ptAtT(i[0][index]); 641 SkDPoint pt2 = chopped[1].ptAtT(i[1][index]); 642 REPORTER_ASSERT(reporter, pt1.approximatelyEqual(pt2)); 643 reporter->bumpTestCount(); 644 } 645 } 646 } 647 648 static void cubicIntersectionSelfTest(skiatest::Reporter* reporter) { 649 int firstFail = 0; 650 for (int index = firstFail; index < selfSetCount; ++index) { 651 selfOneOff(reporter, index); 652 } 653 } 654 655 static const SkDCubic coinSet[] = { 656 {{{2, 3}, {0, 4}, {3, 2}, {5, 3}}}, 657 {{{2, 3}, {0, 4}, {3, 2}, {5, 3}}}, 658 659 {{{317, 711}, {322.52285766601562, 711}, {327, 715.4771728515625}, {327, 721}}}, 660 {{{324.07107543945312, 713.928955078125}, {324.4051513671875, 714.26300048828125}, 661 {324.71566772460937, 714.62060546875}, {325, 714.9990234375}}}, 662 }; 663 664 static int coinSetCount = (int) SK_ARRAY_COUNT(coinSet); 665 666 static void coinOneOff(skiatest::Reporter* reporter, int index) { 667 const SkDCubic& cubic1 = coinSet[index]; 668 const SkDCubic& cubic2 = coinSet[index + 1]; 669 oneOff(reporter, cubic1, cubic2, true); 670 } 671 672 static void cubicIntersectionCoinTest(skiatest::Reporter* reporter) { 673 int firstFail = 0; 674 for (int index = firstFail; index < coinSetCount; index += 2) { 675 coinOneOff(reporter, index); 676 } 677 } 678 679 DEF_TEST(PathOpsCubicCoinOneOff, reporter) { 680 coinOneOff(reporter, 0); 681 } 682 683 DEF_TEST(PathOpsCubicIntersectionOneOff, reporter) { 684 newOneOff(reporter, 0, 1); 685 } 686 687 DEF_TEST(PathOpsCubicSelfOneOff, reporter) { 688 selfOneOff(reporter, 0); 689 } 690 691 DEF_TEST(PathOpsCubicIntersection, reporter) { 692 oneOffTests(reporter); 693 cubicIntersectionSelfTest(reporter); 694 cubicIntersectionCoinTest(reporter); 695 standardTestCases(reporter); 696 if (false) CubicIntersection_IntersectionFinder(); 697 if (false) CubicIntersection_RandTest(reporter); 698 } 699