blob: 5e3c18e186b3c17d693ca11cd06a320533cd85e8 [file] [log] [blame]
caryclark@google.com639df892012-01-10 21:46:10 +00001#include "CubicIntersection.h"
2#include "TestUtilities.h"
3
4void quad_to_cubic(const Quadratic& quad, Cubic& cubic) {
5 cubic[0] = quad[0];
6 cubic[1].x = quad[0].x / 3 + quad[1].x * 2 / 3;
7 cubic[1].y = quad[0].y / 3 + quad[1].y * 2 / 3;
8 cubic[2].x = quad[2].x / 3 + quad[1].x * 2 / 3;
9 cubic[2].y = quad[2].y / 3 + quad[1].y * 2 / 3;
10 cubic[3] = quad[2];
11}
12
13static bool tiny(const Cubic& cubic) {
14 int index, minX, maxX, minY, maxY;
15 minX = maxX = minY = maxY = 0;
16 for (index = 1; index < 4; ++index) {
17 if (cubic[minX].x > cubic[index].x) {
18 minX = index;
19 }
20 if (cubic[minY].y > cubic[index].y) {
21 minY = index;
22 }
23 if (cubic[maxX].x < cubic[index].x) {
24 maxX = index;
25 }
26 if (cubic[maxY].y < cubic[index].y) {
27 maxY = index;
28 }
29 }
30 return approximately_equal(cubic[maxX].x, cubic[minX].x)
31 && approximately_equal(cubic[maxY].y, cubic[minY].y);
32}
33
34void find_tight_bounds(const Cubic& cubic, _Rect& bounds) {
35 CubicPair cubicPair;
36 chop_at(cubic, cubicPair, 0.5);
37 if (!tiny(cubicPair.first()) && !controls_inside(cubicPair.first())) {
38 find_tight_bounds(cubicPair.first(), bounds);
39 } else {
40 bounds.add(cubicPair.first()[0]);
41 bounds.add(cubicPair.first()[3]);
42 }
43 if (!tiny(cubicPair.second()) && !controls_inside(cubicPair.second())) {
44 find_tight_bounds(cubicPair.second(), bounds);
45 } else {
46 bounds.add(cubicPair.second()[0]);
47 bounds.add(cubicPair.second()[3]);
48 }
49}
50
51bool controls_inside(const Cubic& cubic) {
52 return
53 ((cubic[0].x <= cubic[1].x && cubic[0].x <= cubic[2].x && cubic[1].x <= cubic[3].x && cubic[2].x <= cubic[3].x)
54 || (cubic[0].x >= cubic[1].x && cubic[0].x >= cubic[2].x && cubic[1].x >= cubic[3].x && cubic[2].x >= cubic[3].x))
55 && ((cubic[0].y <= cubic[1].y && cubic[0].y <= cubic[2].y && cubic[1].y <= cubic[3].y && cubic[2].y <= cubic[3].y)
56 || (cubic[0].y >= cubic[1].y && cubic[0].y >= cubic[2].y && cubic[1].y >= cubic[3].y && cubic[2].x >= cubic[3].y));
57}
58
59void xy_at_t(const Cubic& cubic, double t, double& x, double& y) {
60 double one_t = 1 - t;
61 double one_t2 = one_t * one_t;
62 double a = one_t2 * one_t;
63 double b = 3 * one_t2 * t;
64 double t2 = t * t;
65 double c = 3 * one_t * t2;
66 double d = t2 * t;
67 x = a * cubic[0].x + b * cubic[1].x + c * cubic[2].x + d * cubic[3].x;
68 y = a * cubic[0].y + b * cubic[1].y + c * cubic[2].y + d * cubic[3].y;
69}