Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / skqp / d6176b0dcacb124539e0cfd051e6d93a9782f020 / . / experimental / Intersection / CubicIntersection_TestData.cpp
blob: e1da4c577ebbe926130e5c67fd3e4ea763d10066 [file] [log] [blame]
caryclark@google.comb45a1b42012-05-18 20:50:33 +0000[diff] [blame]1#define IN_TEST 1
caryclark@google.com639df892012-01-10 21:46:10 +0000[diff] [blame]2#include "CubicIntersection_TestData.h"
3#include <limits>
4
5const Cubic pointDegenerates[] = {
6 {{0, 0}, {0, 0}, {0, 0}, {0, 0}},
7 {{1, 1}, {1, 1}, {1, 1}, {1, 1}},
8 {{1 + PointEpsilon - std::numeric_limits<double>::epsilon(), 1},
9 {1, 1 + PointEpsilon - std::numeric_limits<double>::epsilon()}, {1, 1}, {1, 1}},
10 {{1 + PointEpsilon/2 - std::numeric_limits<double>::epsilon(), 1},
11 {1 - (PointEpsilon/2 - std::numeric_limits<double>::epsilon()), 1}, {1, 1}, {1, 1}}
12};
13
14const size_t pointDegenerates_count = sizeof(pointDegenerates) / sizeof(pointDegenerates[0]);
rmistry@google.comd6176b02012-08-23 18:14:13 +0000[diff] [blame^]15
caryclark@google.com639df892012-01-10 21:46:10 +0000[diff] [blame]16const Cubic notPointDegenerates[] = {
17 {{1 + PointEpsilon + std::numeric_limits<double>::epsilon(), 1}, {1, 1 + PointEpsilon}, {1, 1}, {1, 1}},
18 {{1 + PointEpsilon/2 + std::numeric_limits<double>::epsilon(), 1}, {1 - PointEpsilon/2, 1}, {1, 1}, {1, 1}}
19};
20
21const size_t notPointDegenerates_count = sizeof(notPointDegenerates) / sizeof(notPointDegenerates[0]);
22
23// from http://www.truetex.com/bezint.htm
24const Cubic tests[][2] = {
25 { // intersects in one place (data gives bezier clip fits
26 {{0, 45},
27 {6.0094158284751593, 51.610357411322688},
28 {12.741093228940867, 55.981703949474607},
29 {20.021417396476362, 58.652245509710262}},
30 {{2.2070737699246674, 52.703494107327209},
31 {31.591482272629477, 23.811002295222025},
32 {76.824588616426425, 44.049473790502674},
33 {119.25488947221436, 55.599248272955073}}
34 },
35 { // intersects in three places
36 {{0, 45}, {50, 100}, {150, 0}, {200, 55}},
37 {{0, 55}, {50, 0}, {150, 100}, {200, 45}}
38 },
39 { // intersects in one place, cross over is nearly parallel
40 {{0, 0}, {0, 100}, {200, 0}, {200, 100}},
41 {{0, 100}, {0, 0}, {200, 100}, {200, 0}}
42 },
43 { // intersects in two places
44 {{0, 0}, {0, 100}, {200, 100}, {200, 0}},
45 {{0, 100}, {0, 0}, {200, 0}, {200, 100}}
46 },
47 {
48 {{150, 100}, {150 + 0.1, 150}, {150, 200}, {150, 250}},
49 {{250, 150}, {200, 150 + 0.1}, {150, 150}, {100, 150}}
50 },
51 { // single intersection around 168,185
52 {{200, 100}, {150, 100}, {150, 150}, {200, 150}},
53 {{250, 150}, {250, 100}, {100, 100}, {100, 150}}
54 },
55 {
56 {{1.0, 1.5}, {15.5, 0.5}, {-8.0, 3.5}, {5.0, 1.5}},
57 {{4.0, 0.5}, {5.0, 15.0}, {2.0, -8.5}, {4.0, 4.5}}
58 },
59 {
60 {{664.00168, 0}, {726.11545, 124.22757}, {736.89069, 267.89743}, {694.0017, 400.0002}},
61 {{850.66843, 115.55563}, {728.515, 115.55563}, {725.21347, 275.15309}, {694.0017, 400.0002}}
62 },
63 {
64 {{1, 1}, {12.5, 6.5}, {-4, 6.5}, {7.5, 1}},
65 {{1, 6.5}, {12.5, 1}, {-4, 1}, {.5, 6}}
66 },
67 {
68 {{315.748, 312.84}, {312.644, 318.134}, {305.836, 319.909}, {300.542, 316.804}},
69 {{317.122, 309.05}, {316.112, 315.102}, {310.385, 319.19}, {304.332, 318.179}}
70 },
71 {
rmistry@google.comd6176b02012-08-23 18:14:13 +0000[diff] [blame^]72 {{1046.604051, 172.937967}, {1046.604051, 178.9763059}, {1041.76745, 183.9279165}, {1035.703842, 184.0432409}},
caryclark@google.com639df892012-01-10 21:46:10 +0000[diff] [blame]73 {{1046.452235, 174.7640504}, {1045.544872, 180.1973817}, {1040.837966, 184.0469882}, {1035.505925, 184.0469882}}
74 },
75 {
76 {{125.79356, 199.57382}, {51.16556, 128.93575}, {87.494, 16.67848}, {167.29361, 16.67848}},
77 {{167.29361, 55.81876}, {100.36128, 55.81876}, {68.64099, 145.4755}, {125.7942, 199.57309}}
78 }
79};
80
81const size_t tests_count = sizeof(tests) / sizeof(tests[0]);
82
83Cubic hexTests[][2] = {
rmistry@google.comd6176b02012-08-23 18:14:13 +0000[diff] [blame^]84 {
caryclark@google.com639df892012-01-10 21:46:10 +0000[diff] [blame]85 {{0}} // placeholder for hex converted below
86 }
87};
88
89const size_t hexTests_count = sizeof(hexTests) / sizeof(hexTests[0]);
90
91static const uint64_t testx[2][8] = {
92 {
93 0xf0d0d1ca63075a40LLU, 0x9408ce996a237740LLU, 0x6d5675460fbe5e40LLU, 0x6ef501e1b7487940LLU,
94 0x9a71d2f8143d6540LLU, 0x6bc18bbe02907a40LLU, 0x5b94d92093aa6b40LLU, 0x6ac18bbe02907a40LLU
95 },
96 {
97 0x92c56ed7b6145d40LLU, 0xede4f1255edb7740LLU, 0x1138c1101af75940LLU, 0x42e4f1255edb7740LLU,
rmistry@google.comd6176b02012-08-23 18:14:13 +0000[diff] [blame^]98 0x408e51603ad95640LLU, 0x1e2e8fe9dd927740LLU, 0x1cb4777cd3a75440LLU, 0x212e1390de017740LLU
caryclark@google.com639df892012-01-10 21:46:10 +0000[diff] [blame]99 }
100};
101
102void convert_testx() {
103 const uint64_t* inPtr = testx[0];
104 double* outPtr = &hexTests[sizeof(tests) / sizeof(tests[0]) - 1][0][0].x;
105 for (unsigned index = 0; index < sizeof(testx) / sizeof(testx[0][0]); ++index) {
106 uint64_t input = *inPtr++;
107 unsigned char* output = (unsigned char*) outPtr++;
108 for (unsigned byte = 0; byte < sizeof(input); ++byte) {
109 output[byte] = input >> (7 - byte) * 8;
110 }
111 }
112}
113
114const Cubic lines[] = {
115 {{0, 0}, {0, 0}, {0, 0}, {1, 0}}, // 0: horizontal
116 {{0, 0}, {0, 0}, {1, 0}, {0, 0}},
117 {{0, 0}, {1, 0}, {0, 0}, {0, 0}},
118 {{1, 0}, {0, 0}, {0, 0}, {0, 0}},
119 {{1, 0}, {2, 0}, {3, 0}, {4, 0}},
120 {{0, 0}, {0, 0}, {0, 0}, {0, 1}}, // 5: vertical
121 {{0, 0}, {0, 0}, {0, 1}, {0, 0}},
122 {{0, 0}, {0, 1}, {0, 0}, {0, 0}},
123 {{0, 1}, {0, 0}, {0, 0}, {0, 0}},
124 {{0, 1}, {0, 2}, {0, 3}, {0, 4}},
125 {{0, 0}, {0, 0}, {0, 0}, {1, 1}}, // 10: 3 coincident
126 {{0, 0}, {0, 0}, {1, 1}, {0, 0}},
127 {{0, 0}, {1, 1}, {0, 0}, {0, 0}},
128 {{1, 1}, {0, 0}, {0, 0}, {0, 0}},
129 {{0, 0}, {0, 0}, {1, 1}, {2, 2}}, // 14: 2 coincident
130 {{0, 0}, {1, 1}, {0, 0}, {2, 2}},
131 {{0, 0}, {1, 1}, {2, 2}, {0, 0}},
132 {{1, 1}, {0, 0}, {0, 0}, {2, 2}}, // 17:
133 {{1, 1}, {0, 0}, {2, 2}, {0, 0}},
134 {{1, 1}, {2, 2}, {0, 0}, {0, 0}},
135 {{1, 1}, {2, 2}, {3, 3}, {2, 2}}, // middle-last coincident
136 {{1, 1}, {2, 2}, {3, 3}, {3, 3}}, // middle-last coincident
137 {{1, 1}, {1, 1}, {2, 2}, {2, 2}}, // 2 pairs coincident
138 {{1, 1}, {2, 2}, {1, 1}, {2, 2}},
139 {{1, 1}, {2, 2}, {2, 2}, {1, 1}},
140 {{1, 1}, {1, 1}, {3, 3}, {3, 3}}, // first-middle middle-last coincident
141 {{1, 1}, {2, 2}, {3, 3}, {4, 4}}, // no coincident
142 {{1, 1}, {3, 3}, {2, 2}, {4, 4}},
143 {{1, 1}, {2, 2}, {4, 4}, {3, 3}},
144 {{1, 1}, {3, 3}, {4, 4}, {2, 2}},
145 {{1, 1}, {4, 4}, {2, 2}, {3, 3}},
146 {{1, 1}, {4, 4}, {3, 3}, {2, 2}},
147 {{2, 2}, {1, 1}, {3, 3}, {4, 4}},
148 {{2, 2}, {1, 1}, {4, 4}, {3, 3}},
149 {{2, 2}, {3, 3}, {1, 1}, {4, 4}},
150 {{2, 2}, {3, 3}, {4, 4}, {1, 1}},
151 {{2, 2}, {4, 4}, {1, 1}, {3, 3}},
152 {{2, 2}, {4, 4}, {3, 3}, {1, 1}},
153};
154
155const size_t lines_count = sizeof(lines) / sizeof(lines[0]);
156
157// 'not a line' tries to fool the line detection code
158const Cubic notLines[] = {
159 {{0, 0}, {0, 0}, {0, 1}, {1, 0}},
160 {{0, 0}, {0, 1}, {0, 0}, {1, 0}},
161 {{0, 0}, {0, 1}, {1, 0}, {0, 0}},
162 {{0, 1}, {0, 0}, {0, 0}, {1, 0}},
163 {{0, 1}, {0, 0}, {1, 0}, {0, 0}},
164 {{0, 1}, {1, 0}, {0, 0}, {0, 0}},
165};
166
167const size_t notLines_count = sizeof(notLines) / sizeof(notLines[0]);
168
169static const double E = PointEpsilon * 2;
170static const double F = PointEpsilon * 3;
caryclark@google.com639df892012-01-10 21:46:10 +0000[diff] [blame]171
172const Cubic modEpsilonLines[] = {
173 {{0, E}, {0, 0}, {0, 0}, {1, 0}}, // horizontal
174 {{0, 0}, {0, E}, {1, 0}, {0, 0}},
175 {{0, 0}, {1, 0}, {0, E}, {0, 0}},
176 {{1, 0}, {0, 0}, {0, 0}, {0, E}},
177 {{1, E}, {2, 0}, {3, 0}, {4, 0}},
178 {{E, 0}, {0, 0}, {0, 0}, {0, 1}}, // vertical
179 {{0, 0}, {E, 0}, {0, 1}, {0, 0}},
180 {{0, 0}, {0, 1}, {E, 0}, {0, 0}},
181 {{0, 1}, {0, 0}, {0, 0}, {E, 0}},
182 {{E, 1}, {0, 2}, {0, 3}, {0, 4}},
183 {{E, 0}, {0, 0}, {0, 0}, {1, 1}}, // 3 coincident
184 {{0, 0}, {E, 0}, {1, 1}, {0, 0}},
185 {{0, 0}, {1, 1}, {E, 0}, {0, 0}},
186 {{1, 1}, {0, 0}, {0, 0}, {E, 0}},
187 {{0, E}, {0, 0}, {1, 1}, {2, 2}}, // 2 coincident
188 {{0, 0}, {1, 1}, {0, E}, {2, 2}},
189 {{0, 0}, {1, 1}, {2, 2}, {0, E}},
190 {{1, 1}, {0, E}, {0, 0}, {2, 2}},
191 {{1, 1}, {0, E}, {2, 2}, {0, 0}},
192 {{1, 1}, {2, 2}, {E, 0}, {0, 0}},
193 {{1, 1}, {2, 2+E}, {3, 3}, {2, 2}}, // middle-last coincident
194 {{1, 1}, {2+E, 2}, {3, 3}, {3, 3}}, // middle-last coincident
195 {{1, 1}, {1, 1}, {2, 2}, {2+E, 2}}, // 2 pairs coincident
196 {{1, 1}, {2, 2}, {1, 1}, {2+E, 2}},
197 {{1, 1}, {2, 2}, {2, 2+E}, {1, 1}},
198 {{1, 1}, {1, 1+E}, {3, 3}, {3, 3}}, // first-middle middle-last coincident
199 {{1, 1}, {2+E, 2}, {3, 3}, {4, 4}}, // no coincident
200 {{1, 1}, {3, 3}, {2, 2}, {4, 4+F}}, // INVESTIGATE: why the epsilon is bigger
201 {{1, 1+F}, {2, 2}, {4, 4}, {3, 3}}, // INVESTIGATE: why the epsilon is bigger
202 {{1, 1}, {3, 3}, {4, 4+E}, {2, 2}},
203 {{1, 1}, {4, 4}, {2, 2}, {3, 3+E}},
204 {{1, 1}, {4, 4}, {3, 3}, {2+E, 2}},
205 {{2, 2}, {1, 1}, {3+E, 3}, {4, 4}},
206 {{2, 2}, {1+E, 1}, {4, 4}, {3, 3}},
207 {{2, 2+E}, {3, 3}, {1, 1}, {4, 4}},
208 {{2+E, 2}, {3, 3}, {4, 4}, {1, 1}},
209 {{2, 2}, {4+E, 4}, {1, 1}, {3, 3}},
210 {{2, 2}, {4, 4}, {3, 3}, {1, 1+E}},
211};
212
213const size_t modEpsilonLines_count = sizeof(modEpsilonLines) / sizeof(modEpsilonLines[0]);
214
215static const double D = PointEpsilon / 2;
216static const double G = PointEpsilon / 3;
217
218const Cubic lessEpsilonLines[] = {
219 {{0, D}, {0, 0}, {0, 0}, {1, 0}}, // horizontal
220 {{0, 0}, {0, D}, {1, 0}, {0, 0}},
221 {{0, 0}, {1, 0}, {0, D}, {0, 0}},
222 {{1, 0}, {0, 0}, {0, 0}, {0, D}},
223 {{1, D}, {2, 0}, {3, 0}, {4, 0}},
224 {{D, 0}, {0, 0}, {0, 0}, {0, 1}}, // vertical
225 {{0, 0}, {D, 0}, {0, 1}, {0, 0}},
226 {{0, 0}, {0, 1}, {D, 0}, {0, 0}},
227 {{0, 1}, {0, 0}, {0, 0}, {D, 0}},
228 {{D, 1}, {0, 2}, {0, 3}, {0, 4}},
229 {{D, 0}, {0, 0}, {0, 0}, {1, 1}}, // 3 coincident
230 {{0, 0}, {D, 0}, {1, 1}, {0, 0}},
231 {{0, 0}, {1, 1}, {D, 0}, {0, 0}},
232 {{1, 1}, {0, 0}, {0, 0}, {D, 0}},
233 {{0, D}, {0, 0}, {1, 1}, {2, 2}}, // 2 coincident
234 {{0, 0}, {1, 1}, {0, D}, {2, 2}},
235 {{0, 0}, {1, 1}, {2, 2}, {0, D}},
236 {{1, 1}, {0, D}, {0, 0}, {2, 2}},
237 {{1, 1}, {0, D}, {2, 2}, {0, 0}},
238 {{1, 1}, {2, 2}, {D, 0}, {0, 0}},
239 {{1, 1}, {2, 2+D}, {3, 3}, {2, 2}}, // middle-last coincident
240 {{1, 1}, {2+D, 2}, {3, 3}, {3, 3}}, // middle-last coincident
241 {{1, 1}, {1, 1}, {2, 2}, {2+D, 2}}, // 2 pairs coincident
242 {{1, 1}, {2, 2}, {1, 1}, {2+D, 2}},
243 {{1, 1}, {2, 2}, {2, 2+D}, {1, 1}},
244 {{1, 1}, {1, 1+D}, {3, 3}, {3, 3}}, // first-middle middle-last coincident
245 {{1, 1}, {2+D/2, 2}, {3, 3}, {4, 4}}, // no coincident (FIXME: N as opposed to N/2 failed)
246 {{1, 1}, {3, 3}, {2, 2}, {4, 4+D}},
247 {{1, 1+D}, {2, 2}, {4, 4}, {3, 3}},
248 {{1, 1}, {3, 3}, {4, 4+D}, {2, 2}},
249 {{1, 1}, {4, 4}, {2, 2}, {3, 3+D}},
250 {{1, 1}, {4, 4}, {3, 3}, {2+G, 2}}, // INVESTIGATE: why the epsilon is smaller
251 {{2, 2}, {1, 1}, {3+D, 3}, {4, 4}},
252 {{2, 2}, {1+D, 1}, {4, 4}, {3, 3}},
253 {{2, 2+D}, {3, 3}, {1, 1}, {4, 4}},
254 {{2+G, 2}, {3, 3}, {4, 4}, {1, 1}}, // INVESTIGATE: why the epsilon is smaller
255 {{2, 2}, {4+D, 4}, {1, 1}, {3, 3}},
256 {{2, 2}, {4, 4}, {3, 3}, {1, 1+D}},
257};
258
259const size_t lessEpsilonLines_count = sizeof(lessEpsilonLines) / sizeof(lessEpsilonLines[0]);
260
261static const double N = -PointEpsilon / 2;
262static const double M = -PointEpsilon / 3;
263
264const Cubic negEpsilonLines[] = {
265 {{0, N}, {0, 0}, {0, 0}, {1, 0}}, // horizontal
266 {{0, 0}, {0, N}, {1, 0}, {0, 0}},
267 {{0, 0}, {1, 0}, {0, N}, {0, 0}},
268 {{1, 0}, {0, 0}, {0, 0}, {0, N}},
269 {{1, N}, {2, 0}, {3, 0}, {4, 0}},
270 {{N, 0}, {0, 0}, {0, 0}, {0, 1}}, // vertical
271 {{0, 0}, {N, 0}, {0, 1}, {0, 0}},
272 {{0, 0}, {0, 1}, {N, 0}, {0, 0}},
273 {{0, 1}, {0, 0}, {0, 0}, {N, 0}},
274 {{N, 1}, {0, 2}, {0, 3}, {0, 4}},
275 {{N, 0}, {0, 0}, {0, 0}, {1, 1}}, // 3 coincident
276 {{0, 0}, {N, 0}, {1, 1}, {0, 0}},
277 {{0, 0}, {1, 1}, {N, 0}, {0, 0}},
278 {{1, 1}, {0, 0}, {0, 0}, {N, 0}},
279 {{0, N}, {0, 0}, {1, 1}, {2, 2}}, // 2 coincident
280 {{0, 0}, {1, 1}, {0, N}, {2, 2}},
281 {{0, 0}, {1, 1}, {2, 2}, {0, N}},
282 {{1, 1}, {0, N}, {0, 0}, {2, 2}},
283 {{1, 1}, {0, N}, {2, 2}, {0, 0}},
284 {{1, 1}, {2, 2}, {N, 0}, {0, 0}},
285 {{1, 1}, {2, 2+N}, {3, 3}, {2, 2}}, // middle-last coincident
286 {{1, 1}, {2+N, 2}, {3, 3}, {3, 3}}, // middle-last coincident
287 {{1, 1}, {1, 1}, {2, 2}, {2+N, 2}}, // 2 pairs coincident
288 {{1, 1}, {2, 2}, {1, 1}, {2+N, 2}},
289 {{1, 1}, {2, 2}, {2, 2+N}, {1, 1}},
290 {{1, 1}, {1, 1+N}, {3, 3}, {3, 3}}, // first-middle middle-last coincident
291 {{1, 1}, {2+N/2, 2}, {3, 3}, {4, 4}}, // no coincident (FIXME: N as opposed to N/2 failed)
292 {{1, 1}, {3, 3}, {2, 2}, {4, 4+N}},
293 {{1, 1+N}, {2, 2}, {4, 4}, {3, 3}},
294 {{1, 1}, {3, 3}, {4, 4+N}, {2, 2}},
295 {{1, 1}, {4, 4}, {2, 2}, {3, 3+N}},
296 {{1, 1}, {4, 4}, {3, 3}, {2+M, 2}}, // INVESTIGATE: why the epsilon is smaller
297 {{2, 2}, {1, 1}, {3+N, 3}, {4, 4}},
298 {{2, 2}, {1+N, 1}, {4, 4}, {3, 3}},
299 {{2, 2+N}, {3, 3}, {1, 1}, {4, 4}},
300 {{2+M, 2}, {3, 3}, {4, 4}, {1, 1}}, // INVESTIGATE: why the epsilon is smaller
301 {{2, 2}, {4+N, 4}, {1, 1}, {3, 3}},
302 {{2, 2}, {4, 4}, {3, 3}, {1, 1+N}},
303};
304
305const size_t negEpsilonLines_count = sizeof(negEpsilonLines) / sizeof(negEpsilonLines[0]);