From fa2aeee27af27f2934ee52a9732148f66481fb03 Mon Sep 17 00:00:00 2001 From: "caryclark@google.com" Date: Mon, 15 Jul 2013 13:29:13 +0000 Subject: path ops near exact Modify line intersections to first - match exact ends - compute intersections - match near ends where the exact ends are preferred, then near matches, then computed matches. This pulls matches towards existing end points when possible, and keeps intersection distances consistent with different line/line line/quad and line/cubic computations. BUG= Review URL: https://codereview.chromium.org/19183003 git-svn-id: http://skia.googlecode.com/svn/trunk@10073 2bbb7eff-a529-9590-31e7-b0007b416f81 --- src/pathops/SkOpSegment.h | 1 + 1 file changed, 1 insertion(+) (limited to 'src/pathops/SkOpSegment.h') diff --git a/src/pathops/SkOpSegment.h b/src/pathops/SkOpSegment.h index 3cbd29e77e..7e5e644f1d 100644 --- a/src/pathops/SkOpSegment.h +++ b/src/pathops/SkOpSegment.h @@ -254,6 +254,7 @@ public: const SkPoint& oPt); int addUnsortableT(SkOpSegment* other, bool start, const SkPoint& pt, double newT); bool betweenTs(int lesser, double testT, int greater) const; + void checkEnds(); int computeSum(int startIndex, int endIndex, bool binary); int crossedSpanY(const SkPoint& basePt, SkScalar* bestY, double* hitT, bool* hitSomething, double mid, bool opp, bool current) const; -- cgit v1.2.3