InsetConvexPolyTest.cpp 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106
  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(InsetConvexPoly, reporter) {
  10. SkTDArray<SkPoint> rrectPoly;
  11. // round rect
  12. *rrectPoly.push() = SkPoint::Make(-100, 55);
  13. *rrectPoly.push() = SkPoint::Make(100, 55);
  14. *rrectPoly.push() = SkPoint::Make(100 + 2.5f, 50 + 4.330127f);
  15. *rrectPoly.push() = SkPoint::Make(100 + 3.535534f, 50 + 3.535534f);
  16. *rrectPoly.push() = SkPoint::Make(100 + 4.330127f, 50 + 2.5f);
  17. *rrectPoly.push() = SkPoint::Make(105, 50);
  18. *rrectPoly.push() = SkPoint::Make(105, -50);
  19. *rrectPoly.push() = SkPoint::Make(100 + 4.330127f, -50 - 2.5f);
  20. *rrectPoly.push() = SkPoint::Make(100 + 3.535534f, -50 - 3.535534f);
  21. *rrectPoly.push() = SkPoint::Make(100 + 2.5f, -50 - 4.330127f);
  22. *rrectPoly.push() = SkPoint::Make(100, -55);
  23. *rrectPoly.push() = SkPoint::Make(-100, -55);
  24. *rrectPoly.push() = SkPoint::Make(-100 - 2.5f, -50 - 4.330127f);
  25. *rrectPoly.push() = SkPoint::Make(-100 - 3.535534f, -50 - 3.535534f);
  26. *rrectPoly.push() = SkPoint::Make(-100 - 4.330127f, -50 - 2.5f);
  27. *rrectPoly.push() = SkPoint::Make(-105, -50);
  28. *rrectPoly.push() = SkPoint::Make(-105, 50);
  29. *rrectPoly.push() = SkPoint::Make(-100 - 4.330127f, 50 + 2.5f);
  30. *rrectPoly.push() = SkPoint::Make(-100 - 3.535534f, 50 + 3.535534f);
  31. *rrectPoly.push() = SkPoint::Make(-100 - 2.5f, 50 + 4.330127f);
  32. REPORTER_ASSERT(reporter, SkIsConvexPolygon(rrectPoly.begin(), rrectPoly.count()));
  33. // inset a little
  34. SkTDArray<SkPoint> insetPoly;
  35. bool result = SkInsetConvexPolygon(rrectPoly.begin(), rrectPoly.count(), 3, &insetPoly);
  36. REPORTER_ASSERT(reporter, result);
  37. REPORTER_ASSERT(reporter, SkIsConvexPolygon(insetPoly.begin(), insetPoly.count()));
  38. // inset to rect
  39. result = SkInsetConvexPolygon(rrectPoly.begin(), rrectPoly.count(), 10, &insetPoly);
  40. REPORTER_ASSERT(reporter, result);
  41. REPORTER_ASSERT(reporter, SkIsConvexPolygon(insetPoly.begin(), insetPoly.count()));
  42. REPORTER_ASSERT(reporter, insetPoly.count() == 4);
  43. if (insetPoly.count() == 4) {
  44. REPORTER_ASSERT(reporter, insetPoly[0].equals(-95, 45));
  45. REPORTER_ASSERT(reporter, insetPoly[1].equals(95, 45));
  46. REPORTER_ASSERT(reporter, insetPoly[2].equals(95, -45));
  47. REPORTER_ASSERT(reporter, insetPoly[3].equals(-95, -45));
  48. }
  49. // just to full inset
  50. // fails, but outputs a line segment
  51. result = SkInsetConvexPolygon(rrectPoly.begin(), rrectPoly.count(), 55, &insetPoly);
  52. REPORTER_ASSERT(reporter, !result);
  53. REPORTER_ASSERT(reporter, !SkIsConvexPolygon(insetPoly.begin(), insetPoly.count()));
  54. REPORTER_ASSERT(reporter, insetPoly.count() == 2);
  55. if (insetPoly.count() == 2) {
  56. REPORTER_ASSERT(reporter, insetPoly[0].equals(-50, 0));
  57. REPORTER_ASSERT(reporter, insetPoly[1].equals(50, 0));
  58. }
  59. // past full inset
  60. result = SkInsetConvexPolygon(rrectPoly.begin(), rrectPoly.count(), 75, &insetPoly);
  61. REPORTER_ASSERT(reporter, !result);
  62. REPORTER_ASSERT(reporter, insetPoly.count() == 1);
  63. // troublesome case
  64. SkTDArray<SkPoint> clippedRRectPoly;
  65. *clippedRRectPoly.push() = SkPoint::Make(335.928101f, 428.219055f);
  66. *clippedRRectPoly.push() = SkPoint::Make(330.414459f, 423.034912f);
  67. *clippedRRectPoly.push() = SkPoint::Make(325.749084f, 417.395508f);
  68. *clippedRRectPoly.push() = SkPoint::Make(321.931946f, 411.300842f);
  69. *clippedRRectPoly.push() = SkPoint::Make(318.963074f, 404.750977f);
  70. *clippedRRectPoly.push() = SkPoint::Make(316.842468f, 397.745850f);
  71. *clippedRRectPoly.push() = SkPoint::Make(315.570068f, 390.285522f);
  72. *clippedRRectPoly.push() = SkPoint::Make(315.145966f, 382.369965f);
  73. *clippedRRectPoly.push() = SkPoint::Make(315.570068f, 374.454346f);
  74. *clippedRRectPoly.push() = SkPoint::Make(316.842468f, 366.994019f);
  75. *clippedRRectPoly.push() = SkPoint::Make(318.963074f, 359.988892f);
  76. *clippedRRectPoly.push() = SkPoint::Make(321.931946f, 353.439056f);
  77. *clippedRRectPoly.push() = SkPoint::Make(325.749084f, 347.344421f);
  78. *clippedRRectPoly.push() = SkPoint::Make(330.414459f, 341.705017f);
  79. *clippedRRectPoly.push() = SkPoint::Make(335.928101f, 336.520813f);
  80. *clippedRRectPoly.push() = SkPoint::Make(342.289948f, 331.791901f);
  81. *clippedRRectPoly.push() = SkPoint::Make(377.312134f, 331.791901f);
  82. *clippedRRectPoly.push() = SkPoint::Make(381.195313f, 332.532593f);
  83. *clippedRRectPoly.push() = SkPoint::Make(384.464935f, 334.754700f);
  84. *clippedRRectPoly.push() = SkPoint::Make(386.687042f, 338.024292f);
  85. *clippedRRectPoly.push() = SkPoint::Make(387.427765f, 341.907532f);
  86. *clippedRRectPoly.push() = SkPoint::Make(387.427765f, 422.832367f);
  87. *clippedRRectPoly.push() = SkPoint::Make(386.687042f, 426.715576f);
  88. *clippedRRectPoly.push() = SkPoint::Make(384.464935f, 429.985168f);
  89. *clippedRRectPoly.push() = SkPoint::Make(381.195313f, 432.207275f);
  90. *clippedRRectPoly.push() = SkPoint::Make(377.312134f, 432.947998f);
  91. *clippedRRectPoly.push() = SkPoint::Make(342.289948f, 432.947998f);
  92. REPORTER_ASSERT(reporter, SkIsConvexPolygon(clippedRRectPoly.begin(),
  93. clippedRRectPoly.count()));
  94. result = SkInsetConvexPolygon(clippedRRectPoly.begin(), clippedRRectPoly.count(), 32.3699417f,
  95. &insetPoly);
  96. REPORTER_ASSERT(reporter, result);
  97. REPORTER_ASSERT(reporter, SkIsConvexPolygon(insetPoly.begin(), insetPoly.count()));
  98. }