From 54359294a7c9dc54802d512a5d891a35c1663392 Mon Sep 17 00:00:00 2001 From: caryclark Date: Thu, 26 Mar 2015 07:52:43 -0700 Subject: cumulative pathops patch Replace the implicit curve intersection with a geometric curve intersection. The implicit intersection proved mathematically unstable and took a long time to zero in on an answer. Use pointers instead of indices to refer to parts of curves. Indices required awkward renumbering. Unify t and point values so that small intervals can be eliminated in one pass. Break cubics up front to eliminate loops and cusps. Make the Simplify and Op code more regular and eliminate arbitrary differences. Add a builder that takes an array of paths and operators. Delete unused code. BUG=skia:3588 R=reed@google.com Review URL: https://codereview.chromium.org/1037573004 --- tests/PathOpsDLineTest.cpp | 4 ---- 1 file changed, 4 deletions(-) (limited to 'tests/PathOpsDLineTest.cpp') diff --git a/tests/PathOpsDLineTest.cpp b/tests/PathOpsDLineTest.cpp index dd86dd39e3..bfad134f77 100644 --- a/tests/PathOpsDLineTest.cpp +++ b/tests/PathOpsDLineTest.cpp @@ -43,10 +43,6 @@ DEF_TEST(PathOpsLineUtilities, reporter) { SkDebugf("%s [%d] expected left\n", __FUNCTION__, index); REPORTER_ASSERT(reporter, 0); } - line2 = line.subDivide(1, 0); - REPORTER_ASSERT(reporter, line[0] == line2[1] && line[1] == line2[0]); - line2 = SkDLine::SubDivide(pts, 1, 0); - REPORTER_ASSERT(reporter, line[0] == line2[1] && line[1] == line2[0]); SkDPoint mid = line.ptAtT(.5); REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX) / 2, mid.fX)); REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY) / 2, mid.fY)); -- cgit v1.2.3