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 "PathOpsTestCommon.h" 8 #include "SkIntersections.h" 9 #include "SkPathOpsCubic.h" 10 #include "SkPathOpsLine.h" 11 #include "SkReduceOrder.h" 12 #include "Test.h" 13 14 struct lineCubic { 15 CubicPts cubic; 16 SkDLine line; 17 }; 18 19 static lineCubic failLineCubicTests[] = { 20 {{{{37.5273438,-1.44140625}, {37.8736992,-1.69921875}, {38.1640625,-2.140625}, 21 {38.3984375,-2.765625}}}, 22 {{{40.625,-5.7890625}, {37.7109375,1.3515625}}}}, 23 }; 24 25 static const size_t failLineCubicTests_count = SK_ARRAY_COUNT(failLineCubicTests); 26 27 static void testFail(skiatest::Reporter* reporter, int iIndex) { 28 const CubicPts& cuPts = failLineCubicTests[iIndex].cubic; 29 SkDCubic cubic; 30 cubic.debugSet(cuPts.fPts); 31 SkASSERT(ValidCubic(cubic)); 32 const SkDLine& line = failLineCubicTests[iIndex].line; 33 SkASSERT(ValidLine(line)); 34 SkReduceOrder reduce1; 35 SkReduceOrder reduce2; 36 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); 37 int order2 = reduce2.reduce(line); 38 if (order1 < 4) { 39 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 40 REPORTER_ASSERT(reporter, 0); 41 } 42 if (order2 < 2) { 43 SkDebugf("[%d] line order=%d\n", iIndex, order2); 44 REPORTER_ASSERT(reporter, 0); 45 } 46 if (order1 == 4 && order2 == 2) { 47 SkIntersections i; 48 int roots = i.intersect(cubic, line); 49 REPORTER_ASSERT(reporter, roots == 0); 50 } 51 } 52 53 static lineCubic lineCubicTests[] = { 54 {{{{0, 6}, {1.0851458311080933, 4.3722810745239258}, {1.5815209150314331, 3.038947582244873}, {1.9683018922805786, 1.9999997615814209}}}, 55 {{{3,2}, {1,2}}}}, 56 57 {{{{0.468027353,4}, {1.06734705,1.33333337}, {1.36700678,0}, {3,0}}}, 58 {{{2,1}, {0,1}}}}, 59 60 {{{{-634.60540771484375, -481.262939453125}, {266.2696533203125, -752.70867919921875}, 61 {-751.8370361328125, -317.37921142578125}, {-969.7427978515625, 824.7255859375}}}, 62 {{{-287.9506133720805678, -557.1376476615772617}, 63 {-285.9506133720805678, -557.1376476615772617}}}}, 64 65 {{{{36.7184372,0.888650894}, {36.7184372,0.888650894}, {35.1233864,0.554015458}, 66 {34.5114098,-0.115255356}}}, {{{35.4531212,0}, {31.9375,0}}}}, 67 68 {{{{421, 378}, {421, 380.209137f}, {418.761414f, 382}, {416, 382}}}, 69 {{{320, 378}, {421, 378.000031f}}}}, 70 71 {{{{416, 383}, {418.761414f, 383}, {421, 380.761414f}, {421, 378}}}, 72 {{{320, 378}, {421, 378.000031f}}}}, 73 74 {{{{154,715}, {151.238571,715}, {149,712.761414}, {149,710}}}, 75 {{{149,675}, {149,710.001465}}}}, 76 77 {{{{0,1}, {1,6}, {4,1}, {4,3}}}, 78 {{{6,1}, {1,4}}}}, 79 80 {{{{0,1}, {2,6}, {4,1}, {5,4}}}, 81 {{{6,2}, {1,4}}}}, 82 83 {{{{0,4}, {3,4}, {6,2}, {5,2}}}, 84 {{{4,3}, {2,6}}}}, 85 #if 0 86 {{{{258, 122}, {260.761414, 122}, { 263, 124.238579}, {263, 127}}}, 87 {{{259.82843, 125.17157}, {261.535522, 123.46447}}}}, 88 #endif 89 {{{{1006.6951293945312,291}, {1023.263671875,291}, {1033.8402099609375,304.43145751953125}, 90 {1030.318359375,321}}}, 91 {{{979.30487060546875,561}, {1036.695068359375,291}}}}, 92 {{{{259.30487060546875,561}, {242.73631286621094,561}, {232.15980529785156,547.56854248046875}, 93 {235.68154907226562,531}}}, 94 {{{286.69512939453125,291}, {229.30485534667969,561}}}}, 95 {{{{1, 2}, {2, 6}, {2, 0}, {1, 0}}}, {{{1, 0}, {1, 2}}}}, 96 {{{{0, 0}, {0, 1}, {0, 1}, {1, 1}}}, {{{0, 1}, {1, 0}}}}, 97 }; 98 99 static const size_t lineCubicTests_count = SK_ARRAY_COUNT(lineCubicTests); 100 101 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { 102 int result; 103 bool flipped = false; 104 if (line[0].fX == line[1].fX) { 105 double top = line[0].fY; 106 double bottom = line[1].fY; 107 flipped = top > bottom; 108 if (flipped) { 109 SkTSwap<double>(top, bottom); 110 } 111 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); 112 } else if (line[0].fY == line[1].fY) { 113 double left = line[0].fX; 114 double right = line[1].fX; 115 flipped = left > right; 116 if (flipped) { 117 SkTSwap<double>(left, right); 118 } 119 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); 120 } else { 121 intersections.intersect(cubic, line); 122 result = intersections.used(); 123 } 124 return result; 125 } 126 127 static void testOne(skiatest::Reporter* reporter, int iIndex) { 128 const CubicPts& cuPts = lineCubicTests[iIndex].cubic; 129 SkDCubic cubic; 130 cubic.debugSet(cuPts.fPts); 131 SkASSERT(ValidCubic(cubic)); 132 const SkDLine& line = lineCubicTests[iIndex].line; 133 SkASSERT(ValidLine(line)); 134 SkReduceOrder reduce1; 135 SkReduceOrder reduce2; 136 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); 137 int order2 = reduce2.reduce(line); 138 if (order1 < 4) { 139 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 140 REPORTER_ASSERT(reporter, 0); 141 } 142 if (order2 < 2) { 143 SkDebugf("[%d] line order=%d\n", iIndex, order2); 144 REPORTER_ASSERT(reporter, 0); 145 } 146 if (order1 == 4 && order2 == 2) { 147 SkIntersections i; 148 int roots = doIntersect(i, cubic, line); 149 for (int pt = 0; pt < roots; ++pt) { 150 double tt1 = i[0][pt]; 151 SkDPoint xy1 = cubic.ptAtT(tt1); 152 double tt2 = i[1][pt]; 153 SkDPoint xy2 = line.ptAtT(tt2); 154 if (!xy1.approximatelyEqual(xy2)) { 155 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n", 156 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 157 } 158 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 159 } 160 #if ONE_OFF_DEBUG 161 double cubicT = i[0][0]; 162 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); 163 SkDPoint sect = cubic.ptAtT(cubicT); 164 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prev.fX, prev.fY, sect.fX, sect.fY); 165 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", sect.fX, sect.fY, cubic[3].fX, cubic[3].fY); 166 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); 167 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prevL.fX, prevL.fY, i.pt(0).fX, i.pt(0).fY); 168 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007); 169 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", i.pt(0).fX, i.pt(0).fY, nextL.fX, nextL.fY); 170 SkDebugf("prevD=%1.9g dist=%1.9g nextD=%1.9g\n", prev.distance(nextL), 171 sect.distance(i.pt(0)), cubic[3].distance(prevL)); 172 #endif 173 } 174 } 175 176 DEF_TEST(PathOpsFailCubicLineIntersection, reporter) { 177 for (size_t index = 0; index < failLineCubicTests_count; ++index) { 178 int iIndex = static_cast<int>(index); 179 testFail(reporter, iIndex); 180 reporter->bumpTestCount(); 181 } 182 } 183 184 DEF_TEST(PathOpsCubicLineIntersection, reporter) { 185 for (size_t index = 0; index < lineCubicTests_count; ++index) { 186 int iIndex = static_cast<int>(index); 187 testOne(reporter, iIndex); 188 reporter->bumpTestCount(); 189 } 190 } 191 192 DEF_TEST(PathOpsCubicLineIntersectionOneOff, reporter) { 193 int iIndex = 0; 194 testOne(reporter, iIndex); 195 const CubicPts& cuPts = lineCubicTests[iIndex].cubic; 196 SkDCubic cubic; 197 cubic.debugSet(cuPts.fPts); 198 const SkDLine& line = lineCubicTests[iIndex].line; 199 SkIntersections i; 200 i.intersect(cubic, line); 201 SkASSERT(i.used() == 1); 202 } 203
