Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(927)

Side by Side Diff: tests/PathOpsQuadIntersectionTest.cpp

Issue 12880016: Add intersections for path ops (Closed) Base URL: http://skia.googlecode.com/svn/trunk/
Patch Set: Created 7 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « tests/PathOpsLineParametetersTest.cpp ('k') | tests/PathOpsQuadIntersectionTestData.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
(Empty)
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 "SkIntersections.h"
9 #include "SkPathOpsRect.h"
10 #include "SkReduceOrder.h"
11 #include "Test.h"
12
13 static void standardTestCases(skiatest::Reporter* reporter) {
14 bool showSkipped = false;
15 for (size_t index = 0; index < quadraticTests_count; ++index) {
16 const SkDQuad& quad1 = quadraticTests[index][0];
17 const SkDQuad& quad2 = quadraticTests[index][1];
18 SkReduceOrder reduce1, reduce2;
19 int order1 = reduce1.reduce(quad1, SkReduceOrder::kFill_Style);
20 int order2 = reduce2.reduce(quad2, SkReduceOrder::kFill_Style);
21 if (order1 < 3) {
22 if (showSkipped) {
23 SkDebugf("[%d] quad1 order=%d\n", static_cast<int>(index), order 1);
24 }
25 }
26 if (order2 < 3) {
27 if (showSkipped) {
28 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order 2);
29 }
30 }
31 if (order1 == 3 && order2 == 3) {
32 SkIntersections intersections;
33 intersections.intersect(quad1, quad2);
34 if (intersections.used() > 0) {
35 for (int pt = 0; pt < intersections.used(); ++pt) {
36 double tt1 = intersections[0][pt];
37 SkDPoint xy1 = quad1.xyAtT(tt1);
38 double tt2 = intersections[1][pt];
39 SkDPoint xy2 = quad2.xyAtT(tt2);
40 if (!xy1.approximatelyEqual(xy2)) {
41 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
42 __FUNCTION__, static_cast<int>(index), pt, tt1, xy1.fX, xy1.fY,
43 tt2, xy2.fX, xy2.fY);
44 REPORTER_ASSERT(reporter, 0);
45 }
46 }
47 }
48 }
49 }
50 }
51
52 static const SkDQuad testSet[] = {
53 {{{3.0774019473063863, 3.35198509346713}, {3.0757503498668397, 3.32732062394 5933},
54 {3.0744102085015879, 3.3025879417907196}}},
55 {{{3.053913680774329, 3.3310471586283938}, {3.0758730889691694, 3.3273466070 370152},
56 {3.0975671980059394, 3.3235031316554351}}},
57
58 {{{3.39068129, 4.44939202}, {3.03659239, 3.81843234}, {3.06844529, 3.0210092 2}}},
59 {{{2.10714698, 3.44196686}, {3.12180288, 3.38575704}, {3.75968569, 3.1281838 }}},
60
61 {{{2.74792918, 4.77711896}, {2.82236867, 4.23882547}, {2.82848144, 3.6372934 1}}},
62 {{{2.62772567, 3.64823958}, {3.46652495, 3.64258364}, {4.1425079, 3.48623815 }}},
63
64 {{{1.34375, 2.03125}, {2.2734375, 2.6640625}, {3.25, 3.25}}},
65 {{{3.96875, 4.65625}, {3.3359375, 3.7265625}, {2.75, 2.75}}},
66
67 {{{0, 1}, {0.324417544, 2.27953848}, {0.664376547, 2.58940267}}},
68 {{{1, 2}, {0.62109375, 2.70703125}, {0.640625, 2.546875}}},
69
70 {{{1, 2}, {0.984375, 2.3359375}, {1.0625, 2.15625}}},
71 {{{0, 1}, {0.983539095, 2.30041152}, {1.47325103, 2.61316872}}},
72
73 {{{4.09011926, 2.20971038}, {4.74608133, 1.9335932}, {5.02469918, 2.00694987 }}},
74 {{{2.79472921, 1.73568666}, {3.36246373, 1.21251209}, {5, 2}}},
75
76 {{{1.80814127, 2.41537795}, {2.23475077, 2.05922313}, {3.16529668, 1.9835876 3}}},
77 {{{2.16505631, 2.55782454}, {2.40541285, 2.02193091}, {2.99836023, 1.6824763 8}}},
78
79 {{{3, 1.875}, {3.375, 1.54296875}, {3.375, 1.421875}}},
80 {{{3.375, 1.421875}, {3.3749999999999996, 1.3007812499999998}, {3, 2}}},
81
82 {{{3.34, 8.98}, {2.83363281, 9.4265625}, {2.83796875, 9.363125}}},
83 {{{2.83796875, 9.363125}, {2.84230469, 9.2996875}, {3.17875, 9.1725}}},
84
85 {{{2.7279999999999998, 3.024}, {2.5600000000000005, 2.5600000000000005},
86 {2.1520000000000001, 1.8560000000000001}}},
87 {{{0.66666666666666652, 1.1481481481481481}, {1.3333333333333326, 1.33333333 33333335},
88 {2.6666666666666665, 2.1851851851851851}}},
89
90 {{{2.728, 3.024}, {2.56, 2.56}, {2.152, 1.856}}},
91 {{{0.666666667, 1.14814815}, {1.33333333, 1.33333333}, {2.66666667, 2.185185 19}}},
92
93 {{{0.875, 1.5}, {1.03125, 1.11022302e-16}, {1, 0}}},
94 {{{0.875, 0.859375}, {1.6875, 0.73046875}, {2.5, 0.625}}},
95
96 {{{1.64451042, 0.0942001592}, {1.53635465, 0.00152863961}, {1, 0}}},
97 {{{1.27672209, 0.15}, {1.32143477, 9.25185854e-17}, {1, 0}}},
98
99 {{{0, 0}, {0.51851851851851849, 1.0185185185185186}, {1.2592592592592591, 1. 9259259259259258}}},
100 {{{1.2592592592592593, 1.9259259259259265}, {0.51851851851851893, 1.01851851 85185195}, {0, 0}}},
101
102 {{{1.93281168, 2.58856757}, {2.38543691, 2.7096125}, {2.51967352, 2.34531784 }}},
103 {{{2.51967352, 2.34531784}, {2.65263731, 2.00639194}, {3.1212119, 1.98608967 }}},
104 {{{2.09544533, 2.51981963}, {2.33331524, 2.25252128}, {2.92003302, 2.3944231 1}}},
105
106 {{{0.924337655, 1.94072717}, {1.25185043, 1.52836494}, {1.71793901, 1.061499 51}}},
107 {{{0.940798831, 1.67439357}, {1.25988251, 1.39778567}, {1.71791672, 1.066503 13}}},
108
109 {{{0.924337655, 1.94072717}, {1.39158994, 1.32418496}, {2.14967426, 0.687365 435}}},
110 {{{0.940798831, 1.67439357}, {1.48941875, 1.16280321}, {2.47884711, 0.604659 21}}},
111
112 {{{1.7465749139282332, 1.9930452039527999}, {1.8320006564080331, 1.859481345 189089},
113 {1.8731035127758437, 1.6344055934266613}}},
114 {{{1.8731035127758437, 1.6344055934266613}, {1.89928170345231, 1.50064055189 43067},
115 {1.9223833226085514, 1.3495796165215643}}},
116 {{{1.74657491, 1.9930452}, {1.87407679, 1.76762853}, {1.92238332, 1.34957962 }}},
117 {{{0.60797907, 1.68776977}, {1.0447864, 1.50810914}, {1.87464474, 1.63655092 }}},
118 {{{1.87464474, 1.63655092}, {2.70450308, 1.76499271}, {4, 3}}},
119
120 {{{1.2071879545809394, 0.82163474041730045}, {1.1534203513372994, 0.52790870 069930229},
121 {1.0880000000000001, 0.29599999999999982}}}, //t=0.63155333662549329 ,0.80000000000000004
122 {{{0.33333333333333326, 0.81481481481481488}, {0.63395173631977997, 0.687441 36726313931},
123 {1.205684411948591, 0.81344322326274499}}},
124 {{{0.33333333333333326, 0.81481481481481488}, {0.63396444791444551, 0.687433 68362444768},
125 {1.205732763658403, 0.81345617746834109}}}, //t=0.33333333333333331, 0.63396444791444551
126 {{{1.205684411948591, 0.81344322326274499}, {1.2057085875611198, 0.813449699 99329253},
127 {1.205732763658403, 0.81345617746834109}}},
128
129 {{{1.20718795, 0.82163474}, {1.15342035, 0.527908701}, {1.088, 0.296}}},
130 {{{1.20568441, 0.813443223}, {1.20570859, 0.8134497}, {1.20573276, 0.8134561 77}}},
131
132 {{{41.5072916, 87.1234036}, {28.2747836, 80.9545395}, {23.5780771, 69.334412 6}}},
133 {{{72.9633878, 95.6593007}, {42.7738746, 88.4730382}, {31.1932785, 80.245802 9}}},
134
135 {{{31.1663962, 54.7302484}, {31.1662882, 54.7301074}, {31.1663969, 54.730248 5}}},
136 {{{26.0404936, 45.4260361}, {27.7887523, 33.1863051}, {40.8833242, 26.030185 5}}},
137
138 {{{29.9404074, 49.1672596}, {44.3131071, 45.3915253}, {58.1067559, 59.506181 4}}},
139 {{{72.6510251, 64.2972928}, {53.6989659, 60.1862397}, {35.2053722, 44.839112 6}}},
140
141 {{{52.14807018377202, 65.012420045148644}, {44.778669050208237, 66.315562705 604378},
142 {51.619118408823567, 63.787827046262684}}},
143 {{{30.004993234763383, 93.921296668202288}, {53.384822003076991, 60.73218034 1802753},
144 {58.652998934338584, 43.111073088306185}}},
145
146 {{{80.897794748143198, 49.236332042718459}, {81.082078218891212, 64.06674990 4488631},
147 {69.972305057149981, 72.968595519850993}}},
148 {{{72.503745601281395, 32.952320736577882}, {88.030880716061645, 38.13719484 7810164},
149 {73.193774825517906, 67.773492479591397}}},
150
151 {{{67.426548091427676, 37.993772624988935}, {51.129513170665035, 57.54228123 4563646},
152 {44.594748190899189, 65.644267382683879}}},
153 {{{61.336508189019057, 82.693132843213675}, {54.825078921449354, 71.66393279 9212432},
154 {47.727444217558926, 61.4049645128392}}},
155
156 {{{67.4265481, 37.9937726}, {51.1295132, 57.5422812}, {44.5947482, 65.644267 4}}},
157 {{{61.3365082, 82.6931328}, {54.8250789, 71.6639328}, {47.7274442, 61.404964 5}}},
158
159 {{{53.774852327053594, 53.318060789841951}, {45.787877803416805, 51.39349202 6284981},
160 {46.703936967162392, 53.06860709822206}}},
161 {{{46.703936967162392, 53.06860709822206}, {47.619996130907957, 54.743722170 15916},
162 {53.020051653535361, 48.633140968832024}}},
163
164 {{{50.934805397717923, 51.52391952648901}, {56.803308902971423, 44.246234610 627596},
165 {69.776888596721406, 40.166645096692555}}},
166 {{{50.230212796400401, 38.386469101526998}, {49.855620812184917, 38.81899039 2153609},
167 {56.356567496227363, 47.229909093319407}}},
168
169 {{{36.148792695174222, 70.336952793070424}, {36.141613037691357, 70.71165473 9870085},
170 {36.154708826402597, 71.088492662905836}}},
171 {{{35.216235592661825, 70.580199617313212}, {36.244476835123969, 71.01089778 7304074},
172 {37.230244263238326, 71.423156953613102}}},
173
174 // this pair is nearly coincident, and causes the quartic code to produce ba d
175 // data. Mathematica doesn't think they touch. Graphically, I can't tell.
176 // it may not be so bad to pretend that they don't touch, if I can detect th at
177 {{{369.848602, 145.680267}, {382.360413, 121.298294}, {406.207703, 121.29829 4}}},
178 {{{369.850525, 145.675964}, {382.362915, 121.29287}, {406.211273, 121.29287} }},
179
180 {{{33.567436351153468, 62.336347586395924}, {35.200980274619084, 65.03856146 0144479},
181 {36.479571811084995, 67.632178905412445}}},
182 {{{41.349524945572696, 67.886658677862641}, {39.125562529359087, 67.42977273 5149214},
183 {35.600314083992416, 66.705372160552685}}},
184
185 {{{67.25299631583178, 21.109080184767524}, {43.617595267398613, 33.658034168 577529},
186 {33.38371819435676, 44.214192553988745}}},
187 {{{40.476838859398541, 39.543209911285999}, {36.701186108431131, 34.88179940 16458},
188 {30.102144288878023, 26.739063172945315}}},
189
190 {{{25.367434474345036, 50.4712103169743}, {17.865013304933097, 37.3567410105 59439},
191 {16.818988838905465, 37.682915484123129}}},
192 {{{16.818988838905465, 37.682915484123129}, {15.772964372877833, 38.00908995 7686811},
193 {20.624104547604965, 41.825131596683121}}},
194
195 {{{26.440225044088567, 79.695009812848298}, {26.085525979582247, 83.71792835 4134784},
196 {27.075079976297072, 84.820633667838905}}},
197 {{{27.075079976297072, 84.820633667838905}, {28.276546859574015, 85.98857418 4029034},
198 {25.649263209500006, 87.166762066617025}}},
199
200 {{{34.879150914024962, 83.862726601601125}, {35.095810134304429, 83.69347321 0169543},
201 {35.359284111931586, 83.488069234177502}}},
202 {{{54.503204203015471, 76.094098492518242}, {51.366889541918894, 71.60985606 1299155},
203 {46.53086955445437, 69.949863036494207}}},
204
205 {{{0, 0}, {1, 0}, {0, 3}}},
206 {{{1, 0}, {0, 1}, {1, 1}}},
207 {{{369.961151, 137.980698}, {383.970093, 121.298294}, {406.213287, 121.29829 4}}},
208 {{{353.2948, 194.351074}, {353.2948, 173.767563}, {364.167572, 160.819855}}} ,
209 {{{360.416077, 166.795715}, {370.126831, 147.872162}, {388.635406, 147.87216 2}}},
210 {{{406.236359, 121.254936}, {409.445679, 121.254936}, {412.975952, 121.78981 8}}},
211 {{{406.235992, 121.254936}, {425.705902, 121.254936}, {439.71994, 137.087616 }}},
212
213 {{{369.8543701171875, 145.66734313964844}, {382.36788940429688, 121.28203582 763672},
214 {406.21844482421875, 121.28203582763672}}},
215 {{{369.96469116210938, 137.96672058105469}, {383.97555541992188, 121.2820358 2763672},
216 {406.2218017578125, 121.28203582763672}}},
217
218 {{{369.962311, 137.976044}, {383.971893, 121.29287}, {406.216125, 121.29287} }},
219
220 {{{400.121704, 149.468719}, {391.949493, 161.037186}, {391.949493, 181.20242 3}}},
221 {{{391.946747, 181.839218}, {391.946747, 155.62442}, {406.115479, 138.855438 }}},
222 {{{360.048828125, 229.2578125}, {360.048828125, 224.4140625}, {362.607421875 , 221.3671875}}},
223 {{{362.607421875, 221.3671875}, {365.166015625, 218.3203125}, {369.228515625 , 218.3203125}}},
224 {{{8, 8}, {10, 10}, {8, -10}}},
225 {{{8, 8}, {12, 12}, {14, 4}}},
226 {{{8, 8}, {9, 9}, {10, 8}}}
227 };
228
229 const size_t testSetCount = sizeof(testSet) / sizeof(testSet[0]);
230
231 static void oneOffTest1(skiatest::Reporter* reporter, size_t outer, size_t inner ) {
232 const SkDQuad& quad1 = testSet[outer];
233 const SkDQuad& quad2 = testSet[inner];
234 SkIntersections intersections2;
235 intersections2.intersect(quad1, quad2);
236 for (int pt = 0; pt < intersections2.used(); ++pt) {
237 double tt1 = intersections2[0][pt];
238 SkDPoint xy1 = quad1.xyAtT(tt1);
239 double tt2 = intersections2[1][pt];
240 SkDPoint xy2 = quad2.xyAtT(tt2);
241 if (!xy1.approximatelyEqual(xy2)) {
242 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
243 __FUNCTION__, static_cast<int>(outer), static_cast<int>(inne r),
244 tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
245 REPORTER_ASSERT(reporter, 0);
246 }
247 #if ONE_OFF_DEBUG
248 SkDebugf("%s [%d][%d] t1=%1.9g (%1.9g, %1.9g) t2=%1.9g\n", __FUNCTION__,
249 outer, inner, tt1, xy1.fX, xy1.fY, tt2);
250 #endif
251 }
252 }
253
254 static void QuadraticIntersection_OneOffTest(skiatest::Reporter* reporter) {
255 oneOffTest1(reporter, 0, 1);
256 oneOffTest1(reporter, 1, 0);
257 }
258
259 static void oneOffTests(skiatest::Reporter* reporter) {
260 for (size_t outer = 0; outer < testSetCount - 1; ++outer) {
261 for (size_t inner = outer + 1; inner < testSetCount; ++inner) {
262 oneOffTest1(reporter, outer, inner);
263 }
264 }
265 }
266
267 static const SkDQuad coincidentTestSet[] = {
268 {{{369.850525, 145.675964}, {382.362915, 121.29287}, {406.211273, 121.29287} }},
269 {{{369.850525, 145.675964}, {382.362915, 121.29287}, {406.211273, 121.29287} }},
270 {{{8, 8}, {10, 10}, {8, -10}}},
271 {{{8, -10}, {10, 10}, {8, 8}}},
272 };
273
274 const size_t coincidentTestSetCount = sizeof(coincidentTestSet) / sizeof(coincid entTestSet[0]);
275
276 static void coincidentTest(skiatest::Reporter* reporter) {
277 for (size_t testIndex = 0; testIndex < coincidentTestSetCount - 1; testIndex += 2) {
278 const SkDQuad& quad1 = coincidentTestSet[testIndex];
279 const SkDQuad& quad2 = coincidentTestSet[testIndex + 1];
280 SkIntersections intersections2;
281 intersections2.intersect(quad1, quad2);
282 REPORTER_ASSERT(reporter, intersections2.coincidentUsed() == 2);
283 REPORTER_ASSERT(reporter, intersections2.used() == 2);
284 for (int pt = 0; pt < intersections2.coincidentUsed(); ++pt) {
285 double tt1 = intersections2[0][pt];
286 double tt2 = intersections2[1][pt];
287 REPORTER_ASSERT(reporter, approximately_equal(1, tt1) || approximate ly_zero(tt1));
288 REPORTER_ASSERT(reporter, approximately_equal(1, tt2) || approximate ly_zero(tt2));
289 }
290 }
291 }
292
293 static int floatSign(double x) {
294 return x < 0 ? -1 : x > 0 ? 1 : 0;
295 }
296
297 static const SkDQuad pointFinderTestSet[] = {
298 //>=0.633974464 0.633974 846 <=
299 {{{1.2071879545809394, 0.82163474041730045}, {1.1534203513372994, 0.527908700699 30229},
300 {1.0880000000000001, 0.29599999999999982}}}, //t=0.63155333662549329, 0 .80000000000000004
301 {{{1.2071879545809394, 0.82163474041730045}, {1.2065040319428038, 0.817667532591 19995},
302 {1.2058123269101506, 0.81370135061854221}}}, //t=0.63155333662549329, 0 .6339049773632347
303 {{{1.2058123269101506, 0.81370135061854221}, {1.152376363978022, 0.5244097415381 026},
304 {1.0880000000000001, 0.29599999999999982}}}, //t=0.6339049773632347, 0 .80000000000000004
305 //>=0.633974083 0.633975 227 <=
306 {{{0.33333333333333326, 0.81481481481481488}, {0.63395173631977997, 0.6874413672 6313931},
307 {1.205684411948591, 0.81344322326274499}}}, //t=0.33333333333333331, 0 .63395173631977986
308 {{{0.33333333333333326, 0.81481481481481488}, {0.63396444791444551, 0.6874336836 2444768},
309 {1.205732763658403, 0.81345617746834109}}}, //t=0.33333333333333331, 0 .63396444791444551
310 {{{1.205684411948591, 0.81344322326274499}, {1.2057085875611198, 0.8134496999932 9253},
311 {1.205732763658403, 0.81345617746834109}}}, //t=0.63395173631977986, 0 .63396444791444551
312 {{{1.205732763658403, 0.81345617746834109}, {1.267928895828891, 0.83008534558465 619},
313 {1.3333333333333333, 0.85185185185185175}}}, //t=0.63396444791444551, 0 .66666666666666663
314 };
315
316 static void pointFinder(const SkDQuad& q1, const SkDQuad& q2) {
317 for (int index = 0; index < 3; ++index) {
318 double t = q1.nearestT(q2[index]);
319 SkDPoint onQuad = q1.xyAtT(t);
320 SkDebugf("%s t=%1.9g (%1.9g,%1.9g) dist=%1.9g\n", __FUNCTION__, t, onQua d.fX, onQuad.fY,
321 onQuad.distance(q2[index]));
322 double left[3];
323 left[0] = ((const SkDLine&) q1[0]).isLeft(q2[index]);
324 left[1] = ((const SkDLine&) q1[1]).isLeft(q2[index]);
325 SkDLine diag = {{q1[0], q1[2]}};
326 left[2] = diag.isLeft(q2[index]);
327 SkDebugf("%s left=(%d, %d, %d) inHull=%s\n", __FUNCTION__, floatSign(lef t[0]),
328 floatSign(left[1]), floatSign(left[2]),
329 q1.pointInHull(q2[index]) ? "true" : "false");
330 }
331 SkDebugf("\n");
332 }
333
334 static void hullIntersect(const SkDQuad& q1, const SkDQuad& q2) {
335 SkDebugf("%s", __FUNCTION__);
336 SkIntersections ts;
337 for (int i1 = 0; i1 < 3; ++i1) {
338 SkDLine l1 = {{q1[i1], q1[(i1 + 1) % 3]}};
339 for (int i2 = 0; i2 < 3; ++i2) {
340 SkDLine l2 = {{q2[i2], q2[(i2 + 1) % 3]}};
341 if (ts.intersect(l1, l2)) {
342 SkDebugf(" [%d,%d]", i1, i2);
343 }
344 }
345 }
346 SkDebugf("\n");
347 }
348
349 static void QuadraticIntersection_PointFinder() {
350 pointFinder(pointFinderTestSet[0], pointFinderTestSet[4]);
351 pointFinder(pointFinderTestSet[4], pointFinderTestSet[0]);
352 pointFinder(pointFinderTestSet[0], pointFinderTestSet[6]);
353 pointFinder(pointFinderTestSet[6], pointFinderTestSet[0]);
354 hullIntersect(pointFinderTestSet[0], pointFinderTestSet[4]);
355 hullIntersect(pointFinderTestSet[0], pointFinderTestSet[6]);
356 }
357
358 static void intersectionFinder(int test1, int test2) {
359 const SkDQuad& quad1 = testSet[test1];
360 const SkDQuad& quad2 = testSet[test2];
361
362 double t1Seed = 0.5;
363 double t2Seed = 0.8;
364 double t1Step = 0.1;
365 double t2Step = 0.1;
366 SkDPoint t1[3], t2[3];
367 bool toggle = true;
368 do {
369 t1[0] = quad1.xyAtT(t1Seed - t1Step);
370 t1[1] = quad1.xyAtT(t1Seed);
371 t1[2] = quad1.xyAtT(t1Seed + t1Step);
372 t2[0] = quad2.xyAtT(t2Seed - t2Step);
373 t2[1] = quad2.xyAtT(t2Seed);
374 t2[2] = quad2.xyAtT(t2Seed + t2Step);
375 double dist[3][3];
376 dist[1][1] = t1[1].distance(t2[1]);
377 int best_i = 1, best_j = 1;
378 for (int i = 0; i < 3; ++i) {
379 for (int j = 0; j < 3; ++j) {
380 if (i == 1 && j == 1) {
381 continue;
382 }
383 dist[i][j] = t1[i].distance(t2[j]);
384 if (dist[best_i][best_j] > dist[i][j]) {
385 best_i = i;
386 best_j = j;
387 }
388 }
389 }
390 if (best_i == 0) {
391 t1Seed -= t1Step;
392 } else if (best_i == 2) {
393 t1Seed += t1Step;
394 }
395 if (best_j == 0) {
396 t2Seed -= t2Step;
397 } else if (best_j == 2) {
398 t2Seed += t2Step;
399 }
400 if (best_i == 1 && best_j == 1) {
401 if ((toggle ^= true)) {
402 t1Step /= 2;
403 } else {
404 t2Step /= 2;
405 }
406 }
407 } while (!t1[1].approximatelyEqual(t2[1]));
408 t1Step = t2Step = 0.1;
409 double t10 = t1Seed - t1Step * 2;
410 double t12 = t1Seed + t1Step * 2;
411 double t20 = t2Seed - t2Step * 2;
412 double t22 = t2Seed + t2Step * 2;
413 SkDPoint test;
414 while (!approximately_zero(t1Step)) {
415 test = quad1.xyAtT(t10);
416 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
417 t1Step /= 2;
418 }
419 t1Step = 0.1;
420 while (!approximately_zero(t1Step)) {
421 test = quad1.xyAtT(t12);
422 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
423 t1Step /= 2;
424 }
425 while (!approximately_zero(t2Step)) {
426 test = quad2.xyAtT(t20);
427 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
428 t2Step /= 2;
429 }
430 t2Step = 0.1;
431 while (!approximately_zero(t2Step)) {
432 test = quad2.xyAtT(t22);
433 t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
434 t2Step /= 2;
435 }
436 #if ONE_OFF_DEBUG
437 SkDebugf("%s t1=(%1.9g<%1.9g<%1.9g) t2=(%1.9g<%1.9g<%1.9g)\n", __FUNCTION__,
438 t10, t1Seed, t12, t20, t2Seed, t22);
439 SkDPoint p10 = quad1.xyAtT(t10);
440 SkDPoint p1Seed = quad1.xyAtT(t1Seed);
441 SkDPoint p12 = quad1.xyAtT(t12);
442 SkDebugf("%s p1=(%1.9g,%1.9g)<(%1.9g,%1.9g)<(%1.9g,%1.9g)\n", __FUNCTION__,
443 p10.fX, p10.fY, p1Seed.fX, p1Seed.fY, p12.fX, p12.fY);
444 SkDPoint p20 = quad2.xyAtT(t20);
445 SkDPoint p2Seed = quad2.xyAtT(t2Seed);
446 SkDPoint p22 = quad2.xyAtT(t22);
447 SkDebugf("%s p2=(%1.9g,%1.9g)<(%1.9g,%1.9g)<(%1.9g,%1.9g)\n", __FUNCTION__,
448 p20.fX, p20.fY, p2Seed.fX, p2Seed.fY, p22.fX, p22.fY);
449 #endif
450 }
451
452 static void QuadraticIntersection_IntersectionFinder() {
453 intersectionFinder(0, 1);
454 }
455
456 static void TestQuadIntersection(skiatest::Reporter* reporter) {
457 oneOffTests(reporter);
458 coincidentTest(reporter);
459 standardTestCases(reporter);
460 if (false) QuadraticIntersection_IntersectionFinder();
461 if (false) QuadraticIntersection_PointFinder();
462 if (false) QuadraticIntersection_OneOffTest(reporter);
463 }
464
465
466 #include "TestClassDef.h"
467 DEFINE_TESTCLASS("PathOpsQuadIntersection", QuadIntersectionTestClass, TestQuadI ntersection)
468
OLDNEW
« no previous file with comments | « tests/PathOpsLineParametetersTest.cpp ('k') | tests/PathOpsQuadIntersectionTestData.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698