PathOpsCubicQuadIntersectionTest.cpp 4.0 KB

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