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 "src/pathops/SkIntersections.h"
8 #include "src/pathops/SkPathOpsLine.h"
9 #include "src/pathops/SkPathOpsQuad.h"
10 #include "src/pathops/SkReduceOrder.h"
11 #include "tests/PathOpsExtendedTest.h"
12 #include "tests/PathOpsTestCommon.h"
13 #include "tests/Test.h"
14
15 #include <utility>
16
17 static struct lineQuad {
18 QuadPts quad;
19 SkDLine line;
20 int result;
21 SkDPoint expected[2];
22 } lineQuadTests[] = {
23 // quad line results
24 {{{{1, 1}, {2, 1}, {0, 2}}}, {{{0, 0}, {1, 1}}}, 1, {{1, 1}, {0, 0}} },
25 {{{{0, 0}, {1, 1}, {3, 1}}}, {{{0, 0}, {3, 1}}}, 2, {{0, 0}, {3, 1}} },
26 {{{{2, 0}, {1, 1}, {2, 2}}}, {{{0, 0}, {0, 2}}}, 0, {{0, 0}, {0, 0}} },
27 {{{{4, 0}, {0, 1}, {4, 2}}}, {{{3, 1}, {4, 1}}}, 0, {{0, 0}, {0, 0}} },
28 {{{{0, 0}, {0, 1}, {1, 1}}}, {{{0, 1}, {1, 0}}}, 1, {{.25, .75}, {0, 0}} },
29 };
30
31 static size_t lineQuadTests_count = SK_ARRAY_COUNT(lineQuadTests);
32
doIntersect(SkIntersections & intersections,const SkDQuad & quad,const SkDLine & line,bool & flipped)33 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line,
34 bool& flipped) {
35 int result;
36 flipped = false;
37 if (line[0].fX == line[1].fX) {
38 double top = line[0].fY;
39 double bottom = line[1].fY;
40 flipped = top > bottom;
41 if (flipped) {
42 using std::swap;
43 swap(top, bottom);
44 }
45 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped);
46 } else if (line[0].fY == line[1].fY) {
47 double left = line[0].fX;
48 double right = line[1].fX;
49 flipped = left > right;
50 if (flipped) {
51 using std::swap;
52 swap(left, right);
53 }
54 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
55 } else {
56 intersections.intersect(quad, line);
57 result = intersections.used();
58 }
59 return result;
60 }
61
62 static struct oneLineQuad {
63 QuadPts quad;
64 SkDLine line;
65 } oneOffs[] = {
66 {{{{97.9337616,100}, {88,112.94265}, {88,130}}},
67 {{{88.919838,120}, {107.058823,120}}}},
68 {{{{447.96701049804687, 894.4381103515625}, {448.007080078125, 894.4239501953125},
69 {448.0140380859375, 894.4215087890625}}},
70 {{{490.43548583984375, 879.40740966796875}, {405.59262084960937, 909.435546875}}}},
71 {{{{142.589081, 102.283646}, {149.821579, 100}, {158, 100}}},
72 {{{90, 230}, {160, 60}}}},
73 {{{{1101, 10}, {1101, 8.3431453704833984}, {1099.828857421875, 7.1711997985839844}}},
74 {{{1099.828857421875,7.1711711883544922}, {1099.121337890625,7.8786783218383789}}}},
75 {{{{973, 507}, {973, 508.24264526367187}, {972.12158203125, 509.12161254882812}}},
76 {{{930, 467}, {973, 510}}}},
77 {{{{369.848602, 145.680267}, {382.360413, 121.298294}, {406.207703, 121.298294}}},
78 {{{406.207703, 121.298294}, {348.781738, 123.864815}}}},
79 };
80
81 static size_t oneOffs_count = SK_ARRAY_COUNT(oneOffs);
82
testOneOffs(skiatest::Reporter * reporter)83 static void testOneOffs(skiatest::Reporter* reporter) {
84 bool flipped = false;
85 for (size_t index = 0; index < oneOffs_count; ++index) {
86 const QuadPts& q = oneOffs[index].quad;
87 SkDQuad quad;
88 quad.debugSet(q.fPts);
89 SkASSERT(ValidQuad(quad));
90 const SkDLine& line = oneOffs[index].line;
91 SkASSERT(ValidLine(line));
92 SkIntersections intersections;
93 int result = doIntersect(intersections, quad, line, flipped);
94 for (int inner = 0; inner < result; ++inner) {
95 double quadT = intersections[0][inner];
96 SkDPoint quadXY = quad.ptAtT(quadT);
97 double lineT = intersections[1][inner];
98 SkDPoint lineXY = line.ptAtT(lineT);
99 if (!quadXY.approximatelyEqual(lineXY)) {
100 quadXY.approximatelyEqual(lineXY);
101 }
102 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY));
103 }
104 }
105 }
106
DEF_TEST(PathOpsQuadLineIntersectionOneOff,reporter)107 DEF_TEST(PathOpsQuadLineIntersectionOneOff, reporter) {
108 testOneOffs(reporter);
109 }
110
DEF_TEST(PathOpsQuadLineIntersection,reporter)111 DEF_TEST(PathOpsQuadLineIntersection, reporter) {
112 for (size_t index = 0; index < lineQuadTests_count; ++index) {
113 int iIndex = static_cast<int>(index);
114 const QuadPts& q = lineQuadTests[index].quad;
115 SkDQuad quad;
116 quad.debugSet(q.fPts);
117 SkASSERT(ValidQuad(quad));
118 const SkDLine& line = lineQuadTests[index].line;
119 SkASSERT(ValidLine(line));
120 SkReduceOrder reducer1, reducer2;
121 int order1 = reducer1.reduce(quad);
122 int order2 = reducer2.reduce(line);
123 if (order1 < 3) {
124 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, iIndex, order1);
125 REPORTER_ASSERT(reporter, 0);
126 }
127 if (order2 < 2) {
128 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
129 REPORTER_ASSERT(reporter, 0);
130 }
131 SkIntersections intersections;
132 bool flipped = false;
133 int result = doIntersect(intersections, quad, line, flipped);
134 REPORTER_ASSERT(reporter, result == lineQuadTests[index].result);
135 if (intersections.used() <= 0) {
136 continue;
137 }
138 for (int pt = 0; pt < result; ++pt) {
139 double tt1 = intersections[0][pt];
140 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1);
141 SkDPoint t1 = quad.ptAtT(tt1);
142 double tt2 = intersections[1][pt];
143 REPORTER_ASSERT(reporter, tt2 >= 0 && tt2 <= 1);
144 SkDPoint t2 = line.ptAtT(tt2);
145 if (!t1.approximatelyEqual(t2)) {
146 SkDebugf("%s [%d,%d] x!= t1=%1.9g (%1.9g,%1.9g) t2=%1.9g (%1.9g,%1.9g)\n",
147 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
148 REPORTER_ASSERT(reporter, 0);
149 }
150 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0])
151 && (lineQuadTests[index].result == 1
152 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) {
153 SkDebugf("%s t1=(%1.9g,%1.9g)\n", __FUNCTION__, t1.fX, t1.fY);
154 REPORTER_ASSERT(reporter, 0);
155 }
156 }
157 }
158 }
159