1 /*
2 * Copyright 2013 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 "include/core/SkTypes.h"
8 #include "include/private/base/SkDebug.h"
9 #include "src/pathops/SkIntersections.h"
10 #include "src/pathops/SkPathOpsCubic.h"
11 #include "src/pathops/SkPathOpsPoint.h"
12 #include "src/pathops/SkPathOpsQuad.h"
13 #include "src/pathops/SkReduceOrder.h"
14 #include "tests/PathOpsTestCommon.h"
15 #include "tests/Test.h"
16
17 #include <array>
18
19 static struct quadCubic {
20 CubicPts cubic;
21 QuadPts quad;
22 } quadCubicTests[] = {
23 {{{{945.08099365234375, 747.1619873046875}, {982.5679931640625, 747.1619873046875}, {1013.6290283203125, 719.656005859375}, {1019.1910400390625, 683.72601318359375}}},
24 {{{945, 747}, {976.0660400390625, 747}, {998.03302001953125, 725.03302001953125}}}},
25
26 {{{{778, 14089}, {778, 14091.208984375}, {776.20916748046875, 14093}, {774, 14093}}},
27 {{{778, 14089}, {777.99957275390625, 14090.65625}, {776.82843017578125, 14091.828125}}}},
28
29 {{{{1020.08099,672.161987}, {1020.08002,630.73999}, {986.502014,597.161987}, {945.080994,597.161987}}},
30 {{{1020,672}, {1020,640.93396}, {998.03302,618.96698}}}},
31
32 {{{{778, 14089}, {778, 14091.208984375}, {776.20916748046875, 14093}, {774, 14093}}},
33 {{{778, 14089}, {777.99957275390625, 14090.65625}, {776.82843017578125, 14091.828125}}}},
34
35 {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}},
36 {{{1110.70715f, 817.292908f}, {1110.41406f, 817.000122f}, {1110, 817}}}},
37
38 {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}},
39 {{{1111, 818}, {1110.99988f, 817.585876f}, {1110.70715f, 817.292908f}}}},
40
41 {{{{55, 207}, {52.238574981689453, 207}, {50, 204.76142883300781}, {50, 202}}},
42 {{{55, 207}, {52.929431915283203, 206.99949645996094},
43 {51.464466094970703, 205.53553771972656}}}},
44
45 {{{{49, 47}, {49, 74.614250183105469}, {26.614250183105469, 97}, {-1, 97}}},
46 {{{-8.659739592076221e-015, 96.991401672363281}, {20.065492630004883, 96.645187377929688},
47 {34.355339050292969, 82.355339050292969}}}},
48
49 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
50 {{{18,226}, {14.686291694641113,226}, {12.342399597167969,228.3424072265625}}}},
51
52 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
53 {{{12.342399597167969,228.3424072265625}, {10,230.68629455566406}, {10,234}}}},
54 };
55
56 static const int quadCubicTests_count = (int) std::size(quadCubicTests);
57
cubicQuadIntersection(skiatest::Reporter * reporter,int index)58 static void cubicQuadIntersection(skiatest::Reporter* reporter, int index) {
59 int iIndex = static_cast<int>(index);
60 const CubicPts& c = quadCubicTests[index].cubic;
61 SkDCubic cubic;
62 cubic.debugSet(c.fPts);
63 SkASSERT(ValidCubic(cubic));
64 const QuadPts& q = quadCubicTests[index].quad;
65 SkDQuad quad;
66 quad.debugSet(q.fPts);
67 SkASSERT(ValidQuad(quad));
68 SkReduceOrder reduce1;
69 SkReduceOrder reduce2;
70 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
71 int order2 = reduce2.reduce(quad);
72 if (order1 != 4) {
73 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
74 REPORTER_ASSERT(reporter, 0);
75 }
76 if (order2 != 3) {
77 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
78 REPORTER_ASSERT(reporter, 0);
79 }
80 SkIntersections i;
81 int roots = i.intersect(cubic, quad);
82 for (int pt = 0; pt < roots; ++pt) {
83 double tt1 = i[0][pt];
84 SkDPoint xy1 = cubic.ptAtT(tt1);
85 double tt2 = i[1][pt];
86 SkDPoint xy2 = quad.ptAtT(tt2);
87 if (!xy1.approximatelyEqual(xy2)) {
88 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
89 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
90 }
91 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
92 }
93 reporter->bumpTestCount();
94 }
95
DEF_TEST(PathOpsCubicQuadIntersection,reporter)96 DEF_TEST(PathOpsCubicQuadIntersection, reporter) {
97 for (int index = 0; index < quadCubicTests_count; ++index) {
98 cubicQuadIntersection(reporter, index);
99 reporter->bumpTestCount();
100 }
101 }
102
DEF_TEST(PathOpsCubicQuadIntersectionOneOff,reporter)103 DEF_TEST(PathOpsCubicQuadIntersectionOneOff, reporter) {
104 cubicQuadIntersection(reporter, 0);
105 }
106