a3f05facab
git-svn-id: http://skia.googlecode.com/svn/trunk@4118 2bbb7eff-a529-9590-31e7-b0007b416f81
47 lines
1.4 KiB
C++
47 lines
1.4 KiB
C++
#include "CurveIntersection.h"
|
|
#include "Intersection_Tests.h"
|
|
#include "QuadraticIntersection_TestData.h"
|
|
|
|
static const Quadratic testSet[] = {
|
|
{{8.0000000000000071, 8.0000000000000071},
|
|
{8.7289570079366854, 8.7289570079366889},
|
|
{9.3914917259458743, 9.0593802763083691}},
|
|
{{8.0000000000000142, 8.0000000000000142},
|
|
{8.1250000000000107, 8.1250000000000071},
|
|
{8.2500000000000071, 8.2187500000000053}}
|
|
};
|
|
|
|
static void oneOffTest() {
|
|
const Quadratic& quad1 = testSet[0];
|
|
const Quadratic& quad2 = testSet[1];
|
|
double minT = 0;
|
|
double maxT = 1;
|
|
bezier_clip(quad1, quad2, minT, maxT);
|
|
}
|
|
|
|
static void standardTestCases() {
|
|
for (size_t index = 0; index < quadraticTests_count; ++index) {
|
|
const Quadratic& quad1 = quadraticTests[index][0];
|
|
const Quadratic& quad2 = quadraticTests[index][1];
|
|
Quadratic reduce1, reduce2;
|
|
int order1 = reduceOrder(quad1, reduce1);
|
|
int order2 = reduceOrder(quad2, reduce2);
|
|
if (order1 < 3) {
|
|
printf("%s [%d] quad1 order=%d\n", __FUNCTION__, (int)index, order1);
|
|
}
|
|
if (order2 < 3) {
|
|
printf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2);
|
|
}
|
|
if (order1 == 3 && order2 == 3) {
|
|
double minT = 0;
|
|
double maxT = 1;
|
|
bezier_clip(reduce1, reduce2, minT, maxT);
|
|
}
|
|
}
|
|
}
|
|
|
|
void QuadraticBezierClip_Test() {
|
|
oneOffTest();
|
|
standardTestCases();
|
|
}
|