Add base types for path ops
Paths contain lines, quads, and cubics, which are
collectively curves.
To work with path intersections, intermediary curves
are constructed. For now, those intermediates use
doubles to guarantee sufficient precision.
The DVector, DPoint, DLine, DQuad, and DCubic
structs encapsulate these intermediate curves.
The DRect and DTriangle structs are created to
describe intersectable areas of interest.
The Bounds struct inherits from SkRect to create
a SkScalar-based rectangle that intersects shared
edges.
This also includes common math equalities and
debugging that the remainder of path ops builds on,
as well as a temporary top-level interface in
include/pathops/SkPathOps.h.
Review URL: https://codereview.chromium.org/12827020
git-svn-id: http://skia.googlecode.com/svn/trunk@8551 2bbb7eff-a529-9590-31e7-b0007b416f81
2013-04-08 11:47:37 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2012 Google Inc.
|
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
|
|
* found in the LICENSE file.
|
|
|
|
*/
|
2013-07-16 16:11:16 +00:00
|
|
|
#include "PathOpsTestCommon.h"
|
Add base types for path ops
Paths contain lines, quads, and cubics, which are
collectively curves.
To work with path intersections, intermediary curves
are constructed. For now, those intermediates use
doubles to guarantee sufficient precision.
The DVector, DPoint, DLine, DQuad, and DCubic
structs encapsulate these intermediate curves.
The DRect and DTriangle structs are created to
describe intersectable areas of interest.
The Bounds struct inherits from SkRect to create
a SkScalar-based rectangle that intersects shared
edges.
This also includes common math equalities and
debugging that the remainder of path ops builds on,
as well as a temporary top-level interface in
include/pathops/SkPathOps.h.
Review URL: https://codereview.chromium.org/12827020
git-svn-id: http://skia.googlecode.com/svn/trunk@8551 2bbb7eff-a529-9590-31e7-b0007b416f81
2013-04-08 11:47:37 +00:00
|
|
|
#include "SkPathOpsTriangle.h"
|
|
|
|
#include "Test.h"
|
|
|
|
|
|
|
|
static const SkDTriangle tests[] = {
|
|
|
|
{{{2, 0}, {3, 1}, {2, 2}}},
|
|
|
|
{{{3, 1}, {2, 2}, {1, 1}}},
|
|
|
|
{{{3, 0}, {2, 1}, {3, 2}}},
|
|
|
|
};
|
|
|
|
|
|
|
|
static const SkDPoint inPoint[] = {
|
|
|
|
{2.5, 1},
|
|
|
|
{2, 1.5},
|
|
|
|
{2.5, 1},
|
|
|
|
};
|
|
|
|
|
|
|
|
static const SkDPoint outPoint[] = {
|
|
|
|
{3, 0},
|
|
|
|
{2.5, 2},
|
|
|
|
{2.5, 2},
|
|
|
|
};
|
|
|
|
|
2013-04-15 19:13:59 +00:00
|
|
|
static const size_t tests_count = SK_ARRAY_COUNT(tests);
|
Add base types for path ops
Paths contain lines, quads, and cubics, which are
collectively curves.
To work with path intersections, intermediary curves
are constructed. For now, those intermediates use
doubles to guarantee sufficient precision.
The DVector, DPoint, DLine, DQuad, and DCubic
structs encapsulate these intermediate curves.
The DRect and DTriangle structs are created to
describe intersectable areas of interest.
The Bounds struct inherits from SkRect to create
a SkScalar-based rectangle that intersects shared
edges.
This also includes common math equalities and
debugging that the remainder of path ops builds on,
as well as a temporary top-level interface in
include/pathops/SkPathOps.h.
Review URL: https://codereview.chromium.org/12827020
git-svn-id: http://skia.googlecode.com/svn/trunk@8551 2bbb7eff-a529-9590-31e7-b0007b416f81
2013-04-08 11:47:37 +00:00
|
|
|
|
2013-04-15 19:13:59 +00:00
|
|
|
static void PathOpsTriangleUtilitiesTest(skiatest::Reporter* reporter) {
|
Add base types for path ops
Paths contain lines, quads, and cubics, which are
collectively curves.
To work with path intersections, intermediary curves
are constructed. For now, those intermediates use
doubles to guarantee sufficient precision.
The DVector, DPoint, DLine, DQuad, and DCubic
structs encapsulate these intermediate curves.
The DRect and DTriangle structs are created to
describe intersectable areas of interest.
The Bounds struct inherits from SkRect to create
a SkScalar-based rectangle that intersects shared
edges.
This also includes common math equalities and
debugging that the remainder of path ops builds on,
as well as a temporary top-level interface in
include/pathops/SkPathOps.h.
Review URL: https://codereview.chromium.org/12827020
git-svn-id: http://skia.googlecode.com/svn/trunk@8551 2bbb7eff-a529-9590-31e7-b0007b416f81
2013-04-08 11:47:37 +00:00
|
|
|
for (size_t index = 0; index < tests_count; ++index) {
|
|
|
|
const SkDTriangle& triangle = tests[index];
|
2013-07-16 16:11:16 +00:00
|
|
|
SkASSERT(ValidTriangle(triangle));
|
Add base types for path ops
Paths contain lines, quads, and cubics, which are
collectively curves.
To work with path intersections, intermediary curves
are constructed. For now, those intermediates use
doubles to guarantee sufficient precision.
The DVector, DPoint, DLine, DQuad, and DCubic
structs encapsulate these intermediate curves.
The DRect and DTriangle structs are created to
describe intersectable areas of interest.
The Bounds struct inherits from SkRect to create
a SkScalar-based rectangle that intersects shared
edges.
This also includes common math equalities and
debugging that the remainder of path ops builds on,
as well as a temporary top-level interface in
include/pathops/SkPathOps.h.
Review URL: https://codereview.chromium.org/12827020
git-svn-id: http://skia.googlecode.com/svn/trunk@8551 2bbb7eff-a529-9590-31e7-b0007b416f81
2013-04-08 11:47:37 +00:00
|
|
|
bool result = triangle.contains(inPoint[index]);
|
|
|
|
if (!result) {
|
|
|
|
SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index);
|
|
|
|
REPORTER_ASSERT(reporter, 0);
|
|
|
|
}
|
|
|
|
result = triangle.contains(outPoint[index]);
|
|
|
|
if (result) {
|
|
|
|
SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__, index);
|
|
|
|
REPORTER_ASSERT(reporter, 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-11-02 07:02:02 +00:00
|
|
|
static const SkDTriangle oneOff[] = {
|
|
|
|
{{{271.03291625750461, 5.0402503630087025e-05}, {275.21652430019037, 3.6997300650817753},
|
|
|
|
{279.25839233398438, 7.7416000366210938}}},
|
|
|
|
|
|
|
|
{{{271.03291625750461, 5.0402503617874572e-05}, {275.21652430019037, 3.6997300650817877},
|
|
|
|
{279.25839233398438, 7.7416000366210938}}}
|
|
|
|
};
|
|
|
|
|
|
|
|
static const size_t oneOff_count = SK_ARRAY_COUNT(oneOff);
|
|
|
|
|
|
|
|
static void PathOpsTriangleOneOffTest(skiatest::Reporter* reporter) {
|
|
|
|
for (size_t index = 0; index < oneOff_count; ++index) {
|
|
|
|
const SkDTriangle& triangle = oneOff[index];
|
|
|
|
SkASSERT(ValidTriangle(triangle));
|
|
|
|
for (int inner = 0; inner < 3; ++inner) {
|
|
|
|
bool result = triangle.contains(triangle.fPts[inner]);
|
|
|
|
if (result) {
|
|
|
|
SkDebugf("%s [%d][%d] point on triangle is not in\n", __FUNCTION__, index, inner);
|
|
|
|
REPORTER_ASSERT(reporter, 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#include "TestClassDef.h"
|
|
|
|
DEFINE_TESTCLASS_SHORT(PathOpsTriangleUtilitiesTest)
|
|
|
|
|
|
|
|
DEFINE_TESTCLASS_SHORT(PathOpsTriangleOneOffTest)
|