Index: src/pathops/SkOpContour.cpp |
diff --git a/src/pathops/SkOpContour.cpp b/src/pathops/SkOpContour.cpp |
index 6d6ad7926ee1500faea7e266f2dbefea118d0fc2..28c072a3c1340200c2cd7f1b2514bd20b19e2c05 100644 |
--- a/src/pathops/SkOpContour.cpp |
+++ b/src/pathops/SkOpContour.cpp |
@@ -13,7 +13,7 @@ bool SkOpContour::addCoincident(int index, SkOpContour* other, int otherIndex, |
const SkIntersections& ts, bool swap) { |
SkPoint pt0 = ts.pt(0).asSkPoint(); |
SkPoint pt1 = ts.pt(1).asSkPoint(); |
- if (pt0 == pt1) { |
+ if (pt0 == pt1 || ts[0][0] == ts[0][1] || ts[1][0] == ts[1][1]) { |
// FIXME: one could imagine a case where it would be incorrect to ignore this |
// suppose two self-intersecting cubics overlap to be coincident -- |
// this needs to check that by some measure the t values are far enough apart |