1 /*
2 * Copyright 2017 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/utils/SkPolyUtils.h"
8 #include "tests/Test.h"
9
DEF_TEST(OffsetSimplePoly,reporter)10 DEF_TEST(OffsetSimplePoly, reporter) {
11 SkTDArray<SkPoint> rrectPoly;
12
13 ///////////////////////////////////////////////////////////////////////
14 // Try convex tests first
15
16 // round rect
17 *rrectPoly.push() = SkPoint::Make(-100, 55);
18 *rrectPoly.push() = SkPoint::Make(100, 55);
19 *rrectPoly.push() = SkPoint::Make(100 + 2.5f, 50 + 4.330127f);
20 *rrectPoly.push() = SkPoint::Make(100 + 3.535534f, 50 + 3.535534f);
21 *rrectPoly.push() = SkPoint::Make(100 + 4.330127f, 50 + 2.5f);
22 *rrectPoly.push() = SkPoint::Make(105, 50);
23 *rrectPoly.push() = SkPoint::Make(105, -50);
24 *rrectPoly.push() = SkPoint::Make(100 + 4.330127f, -50 - 2.5f);
25 *rrectPoly.push() = SkPoint::Make(100 + 3.535534f, -50 - 3.535534f);
26 *rrectPoly.push() = SkPoint::Make(100 + 2.5f, -50 - 4.330127f);
27 *rrectPoly.push() = SkPoint::Make(100, -55);
28 *rrectPoly.push() = SkPoint::Make(-100, -55);
29 *rrectPoly.push() = SkPoint::Make(-100 - 2.5f, -50 - 4.330127f);
30 *rrectPoly.push() = SkPoint::Make(-100 - 3.535534f, -50 - 3.535534f);
31 *rrectPoly.push() = SkPoint::Make(-100 - 4.330127f, -50 - 2.5f);
32 *rrectPoly.push() = SkPoint::Make(-105, -50);
33 *rrectPoly.push() = SkPoint::Make(-105, 50);
34 *rrectPoly.push() = SkPoint::Make(-100 - 4.330127f, 50 + 2.5f);
35 *rrectPoly.push() = SkPoint::Make(-100 - 3.535534f, 50 + 3.535534f);
36 *rrectPoly.push() = SkPoint::Make(-100 - 2.5f, 50 + 4.330127f);
37 SkRect bounds;
38 bounds.setBoundsCheck(rrectPoly.begin(), rrectPoly.count());
39
40 REPORTER_ASSERT(reporter, SkIsConvexPolygon(rrectPoly.begin(), rrectPoly.count()));
41
42 // inset a little
43 SkTDArray<SkPoint> offsetPoly;
44 bool result = SkOffsetSimplePolygon(rrectPoly.begin(), rrectPoly.count(), bounds, 3,
45 &offsetPoly);
46 REPORTER_ASSERT(reporter, result);
47 REPORTER_ASSERT(reporter, SkIsConvexPolygon(offsetPoly.begin(), offsetPoly.count()));
48
49 // inset to rect
50 result = SkOffsetSimplePolygon(rrectPoly.begin(), rrectPoly.count(), bounds, 10, &offsetPoly);
51 REPORTER_ASSERT(reporter, result);
52 REPORTER_ASSERT(reporter, SkIsConvexPolygon(offsetPoly.begin(), offsetPoly.count()));
53 REPORTER_ASSERT(reporter, offsetPoly.count() == 4);
54 if (offsetPoly.count() == 4) {
55 REPORTER_ASSERT(reporter, offsetPoly[0].equals(-95, 45));
56 REPORTER_ASSERT(reporter, offsetPoly[1].equals(95, 45));
57 REPORTER_ASSERT(reporter, offsetPoly[2].equals(95, -45));
58 REPORTER_ASSERT(reporter, offsetPoly[3].equals(-95, -45));
59 }
60
61 // just to full inset
62 // fails, but outputs a line segment
63 result = SkOffsetSimplePolygon(rrectPoly.begin(), rrectPoly.count(), bounds, 55, &offsetPoly);
64 REPORTER_ASSERT(reporter, !result);
65 REPORTER_ASSERT(reporter, !SkIsConvexPolygon(offsetPoly.begin(), offsetPoly.count()));
66 REPORTER_ASSERT(reporter, offsetPoly.count() == 2);
67 if (offsetPoly.count() == 2) {
68 REPORTER_ASSERT(reporter, offsetPoly[0].equals(-50, 0));
69 REPORTER_ASSERT(reporter, offsetPoly[1].equals(50, 0));
70 }
71
72 // past full inset
73 result = SkOffsetSimplePolygon(rrectPoly.begin(), rrectPoly.count(), bounds, 75, &offsetPoly);
74 REPORTER_ASSERT(reporter, !result);
75
76 // troublesome case
77 SkTDArray<SkPoint> clippedRRectPoly;
78 *clippedRRectPoly.push() = SkPoint::Make(335.928101f, 428.219055f);
79 *clippedRRectPoly.push() = SkPoint::Make(330.414459f, 423.034912f);
80 *clippedRRectPoly.push() = SkPoint::Make(325.749084f, 417.395508f);
81 *clippedRRectPoly.push() = SkPoint::Make(321.931946f, 411.300842f);
82 *clippedRRectPoly.push() = SkPoint::Make(318.963074f, 404.750977f);
83 *clippedRRectPoly.push() = SkPoint::Make(316.842468f, 397.745850f);
84 *clippedRRectPoly.push() = SkPoint::Make(315.570068f, 390.285522f);
85 *clippedRRectPoly.push() = SkPoint::Make(315.145966f, 382.369965f);
86 *clippedRRectPoly.push() = SkPoint::Make(315.570068f, 374.454346f);
87 *clippedRRectPoly.push() = SkPoint::Make(316.842468f, 366.994019f);
88 *clippedRRectPoly.push() = SkPoint::Make(318.963074f, 359.988892f);
89 *clippedRRectPoly.push() = SkPoint::Make(321.931946f, 353.439056f);
90 *clippedRRectPoly.push() = SkPoint::Make(325.749084f, 347.344421f);
91 *clippedRRectPoly.push() = SkPoint::Make(330.414459f, 341.705017f);
92 *clippedRRectPoly.push() = SkPoint::Make(335.928101f, 336.520813f);
93 *clippedRRectPoly.push() = SkPoint::Make(342.289948f, 331.791901f);
94 *clippedRRectPoly.push() = SkPoint::Make(377.312134f, 331.791901f);
95 *clippedRRectPoly.push() = SkPoint::Make(381.195313f, 332.532593f);
96 *clippedRRectPoly.push() = SkPoint::Make(384.464935f, 334.754700f);
97 *clippedRRectPoly.push() = SkPoint::Make(386.687042f, 338.024292f);
98 *clippedRRectPoly.push() = SkPoint::Make(387.427765f, 341.907532f);
99 *clippedRRectPoly.push() = SkPoint::Make(387.427765f, 422.832367f);
100 *clippedRRectPoly.push() = SkPoint::Make(386.687042f, 426.715576f);
101 *clippedRRectPoly.push() = SkPoint::Make(384.464935f, 429.985168f);
102 *clippedRRectPoly.push() = SkPoint::Make(381.195313f, 432.207275f);
103 *clippedRRectPoly.push() = SkPoint::Make(377.312134f, 432.947998f);
104 *clippedRRectPoly.push() = SkPoint::Make(342.289948f, 432.947998f);
105 bounds.setBoundsCheck(clippedRRectPoly.begin(), clippedRRectPoly.count());
106
107 REPORTER_ASSERT(reporter, SkIsConvexPolygon(clippedRRectPoly.begin(),
108 clippedRRectPoly.count()));
109
110 result = SkOffsetSimplePolygon(clippedRRectPoly.begin(), clippedRRectPoly.count(), bounds,
111 32.3699417f, &offsetPoly);
112 REPORTER_ASSERT(reporter, result);
113 REPORTER_ASSERT(reporter, SkIsConvexPolygon(offsetPoly.begin(), offsetPoly.count()));
114
115 ////////////////////////////////////////////////////////////////////////////////
116 // Concave tests
117
118 SkTDArray<SkPoint> starPoly;
119 *starPoly.push() = SkPoint::Make(0.0f, -50.0f);
120 *starPoly.push() = SkPoint::Make(14.43f, -25.0f);
121 *starPoly.push() = SkPoint::Make(43.30f, -25.0f);
122 *starPoly.push() = SkPoint::Make(28.86f, 0.0f);
123 *starPoly.push() = SkPoint::Make(43.30f, 25.0f);
124 *starPoly.push() = SkPoint::Make(14.43f, 25.0f);
125 *starPoly.push() = SkPoint::Make(0.0f, 50.0f);
126 *starPoly.push() = SkPoint::Make(-14.43f, 25.0f);
127 *starPoly.push() = SkPoint::Make(-43.30f, 25.0f);
128 *starPoly.push() = SkPoint::Make(-28.86f, 0.0f);
129 *starPoly.push() = SkPoint::Make(-43.30f, -25.0f);
130 *starPoly.push() = SkPoint::Make(-14.43f, -25.0f);
131 bounds.setBoundsCheck(starPoly.begin(), starPoly.count());
132
133 REPORTER_ASSERT(reporter, SkIsSimplePolygon(starPoly.begin(), starPoly.count()));
134
135 // try a variety of distances
136 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, 0.1f,
137 &offsetPoly);
138 REPORTER_ASSERT(reporter, result);
139 REPORTER_ASSERT(reporter, SkIsSimplePolygon(offsetPoly.begin(), offsetPoly.count()));
140
141 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, 5.665f,
142 &offsetPoly);
143 REPORTER_ASSERT(reporter, result);
144 REPORTER_ASSERT(reporter, SkIsSimplePolygon(offsetPoly.begin(), offsetPoly.count()));
145
146 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, 28,
147 &offsetPoly);
148 REPORTER_ASSERT(reporter, result);
149 REPORTER_ASSERT(reporter, SkIsSimplePolygon(offsetPoly.begin(), offsetPoly.count()));
150
151 // down to a point
152 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, 28.866f,
153 &offsetPoly);
154 REPORTER_ASSERT(reporter, !result);
155
156 // and past
157 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, 50.5f,
158 &offsetPoly);
159 REPORTER_ASSERT(reporter, !result);
160
161 // and now out
162 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, -0.1f,
163 &offsetPoly);
164 REPORTER_ASSERT(reporter, result);
165 REPORTER_ASSERT(reporter, SkIsSimplePolygon(offsetPoly.begin(), offsetPoly.count()));
166
167 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, -5.6665f,
168 &offsetPoly);
169 REPORTER_ASSERT(reporter, result);
170 REPORTER_ASSERT(reporter, SkIsSimplePolygon(offsetPoly.begin(), offsetPoly.count()));
171
172 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, -50,
173 &offsetPoly);
174 REPORTER_ASSERT(reporter, result);
175 REPORTER_ASSERT(reporter, SkIsSimplePolygon(offsetPoly.begin(), offsetPoly.count()));
176
177 result = SkOffsetSimplePolygon(starPoly.begin(), starPoly.count(), bounds, -100,
178 &offsetPoly);
179 REPORTER_ASSERT(reporter, result);
180 REPORTER_ASSERT(reporter, SkIsSimplePolygon(offsetPoly.begin(), offsetPoly.count()));
181
182 SkTDArray<SkPoint> intersectingPoly;
183 *intersectingPoly.push() = SkPoint::Make(0.0f, -50.0f);
184 *intersectingPoly.push() = SkPoint::Make(14.43f, -25.0f);
185 *intersectingPoly.push() = SkPoint::Make(43.30f, -25.0f);
186 *intersectingPoly.push() = SkPoint::Make(-28.86f, 0.0f);
187 *intersectingPoly.push() = SkPoint::Make(43.30f, 25.0f);
188 *intersectingPoly.push() = SkPoint::Make(14.43f, 25.0f);
189 *intersectingPoly.push() = SkPoint::Make(0.0f, 50.0f);
190 *intersectingPoly.push() = SkPoint::Make(-14.43f, 25.0f);
191 *intersectingPoly.push() = SkPoint::Make(-43.30f, 25.0f);
192 *intersectingPoly.push() = SkPoint::Make(28.86f, 0.0f);
193 *intersectingPoly.push() = SkPoint::Make(-43.30f, -25.0f);
194 *intersectingPoly.push() = SkPoint::Make(-14.43f, -25.0f);
195
196 // SkOffsetSimplePolygon now assumes that the input is simple, so we'll just check for that
197 result = SkIsSimplePolygon(intersectingPoly.begin(), intersectingPoly.count());
198 REPORTER_ASSERT(reporter, !result);
199 }
200