From 9166dcb3a0e8784bea83d76ae01aa338c049ae05 Mon Sep 17 00:00:00 2001 From: "caryclark@google.com" Date: Mon, 8 Apr 2013 11:50:00 +0000 Subject: Add intersections for path ops This CL depends on https://codereview.chromium.org/12827020/ "Add base types for path ops" The intersection of a line, quadratic, or cubic with another curve (or with itself) is found by solving the implicit equation for the curve pair. The curves are first reduced to find the simplest form that will describe the original, and to detect degenerate or special-case data like horizontal and vertical lines. For cubic self-intersection, and for a pair of cubics, the intersection is found by recursively approximating the cubic with a series of quadratics. The implicit solutions depend on the root finding contained in the DCubic and DQuad structs, and the quartic root finder included here. Review URL: https://codereview.chromium.org/12880016 git-svn-id: http://skia.googlecode.com/svn/trunk@8552 2bbb7eff-a529-9590-31e7-b0007b416f81 --- tests/PathOpsQuadIntersectionTestData.h | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 tests/PathOpsQuadIntersectionTestData.h (limited to 'tests/PathOpsQuadIntersectionTestData.h') diff --git a/tests/PathOpsQuadIntersectionTestData.h b/tests/PathOpsQuadIntersectionTestData.h new file mode 100644 index 0000000000..3090fc96dd --- /dev/null +++ b/tests/PathOpsQuadIntersectionTestData.h @@ -0,0 +1,17 @@ +/* + * Copyright 2012 Google Inc. + * + * Use of this source code is governed by a BSD-style license that can be + * found in the LICENSE file. + */ +#include "SkPathOpsQuad.h" + +extern const SkDQuad quadraticLines[]; +extern const SkDQuad quadraticPoints[]; +extern const SkDQuad quadraticModEpsilonLines[]; +extern const SkDQuad quadraticTests[][2]; + +extern const size_t quadraticLines_count; +extern const size_t quadraticPoints_count; +extern const size_t quadraticModEpsilonLines_count; +extern const size_t quadraticTests_count; -- cgit v1.2.3