work in progress for shape operations
A experimental/Intersection
A experimental/Intersection/Intersections.h
A experimental/Intersection/DataTypes.cpp
A experimental/Intersection/QuadraticReduceOrder.cpp
A experimental/Intersection/IntersectionUtilities.cpp
A experimental/Intersection/CubicIntersection_Tests.h
A experimental/Intersection/LineParameteters_Test.cpp
A experimental/Intersection/ReduceOrder.cpp
A experimental/Intersection/QuadraticIntersection.cpp
A experimental/Intersection/Extrema.h
A experimental/Intersection/CubicIntersection_TestData.h
A experimental/Intersection/QuadraticParameterization_Test.cpp
A experimental/Intersection/TestUtilities.cpp
A experimental/Intersection/CubicRoots.cpp
A experimental/Intersection/QuadraticParameterization.cpp
A experimental/Intersection/QuadraticSubDivide.cpp
A experimental/Intersection/LineIntersection_Test.cpp
A experimental/Intersection/LineIntersection.cpp
A experimental/Intersection/CubicParameterizationCode.cpp
A experimental/Intersection/LineParameters.h
A experimental/Intersection/CubicIntersection.h
A experimental/Intersection/CubeRoot.cpp
A experimental/Intersection/SkAntiEdge.h
A experimental/Intersection/ConvexHull_Test.cpp
A experimental/Intersection/CubicBezierClip_Test.cpp
A experimental/Intersection/CubicIntersection_Tests.cpp
A experimental/Intersection/CubicBezierClip.cpp
A experimental/Intersection/CubicIntersectionT.cpp
A experimental/Intersection/Inline_Tests.cpp
A experimental/Intersection/ReduceOrder_Test.cpp
A experimental/Intersection/QuadraticIntersection_TestData.h
A experimental/Intersection/DataTypes.h
A experimental/Intersection/Extrema.cpp
A experimental/Intersection/EdgeApp.cpp
A experimental/Intersection/CubicIntersection_TestData.cpp
A experimental/Intersection/IntersectionUtilities.h
A experimental/Intersection/CubicReduceOrder.cpp
A experimental/Intersection/CubicCoincidence.cpp
A experimental/Intersection/CubicIntersection_Test.cpp
A experimental/Intersection/CubicIntersection.cpp
A experimental/Intersection/QuadraticUtilities.h
A experimental/Intersection/SkAntiEdge.cpp
A experimental/Intersection/TestUtilities.h
A experimental/Intersection/CubicParameterization_Test.cpp
A experimental/Intersection/LineIntersection.h
A experimental/Intersection/CubicSubDivide.cpp
A experimental/Intersection/CubicParameterization.cpp
A experimental/Intersection/QuadraticBezierClip_Test.cpp
A experimental/Intersection/QuadraticBezierClip.cpp
A experimental/Intersection/BezierClip_Test.cpp
A experimental/Intersection/ConvexHull.cpp
A experimental/Intersection/BezierClip.cpp
A experimental/Intersection/QuadraticIntersection_TestData.cpp
git-svn-id: http://skia.googlecode.com/svn/trunk@3005 2bbb7eff-a529-9590-31e7-b0007b416f81
diff --git a/experimental/Intersection/LineParameters.h b/experimental/Intersection/LineParameters.h
new file mode 100644
index 0000000..1889622
--- /dev/null
+++ b/experimental/Intersection/LineParameters.h
@@ -0,0 +1,94 @@
+#include "DataTypes.h"
+
+// Sources
+// computer-aided design - volume 22 number 9 november 1990 pp 538 - 549
+// online at http://cagd.cs.byu.edu/~tom/papers/bezclip.pdf
+
+class LineParameters {
+public:
+ void cubicEndPoints(const Cubic& pts) {
+ a = pts[0].y - pts[3].y;
+ b = pts[3].x - pts[0].x;
+ c = pts[0].x * pts[3].y - pts[3].x * pts[0].y;
+ }
+
+ void cubicEndPoints(const Cubic& pts, int s, int e) {
+ a = pts[s].y - pts[e].y;
+ b = pts[e].x - pts[s].x;
+ c = pts[s].x * pts[e].y - pts[e].x * pts[s].y;
+ }
+
+ void lineEndPoints(const _Line& pts) {
+ a = pts[0].y - pts[1].y;
+ b = pts[1].x - pts[0].x;
+ c = pts[0].x * pts[1].y - pts[1].x * pts[0].y;
+ }
+
+ void quadEndPoints(const Quadratic& pts) {
+ a = pts[0].y - pts[2].y;
+ b = pts[2].x - pts[0].x;
+ c = pts[0].x * pts[2].y - pts[2].x * pts[0].y;
+ }
+
+ void quadEndPoints(const Quadratic& pts, int s, int e) {
+ a = pts[s].y - pts[e].y;
+ b = pts[e].x - pts[s].x;
+ c = pts[s].x * pts[e].y - pts[e].x * pts[s].y;
+ }
+
+ double normalSquared() {
+ return a * a + b * b;
+ }
+
+ bool normalize() {
+ double normal = sqrt(normalSquared());
+ if (normal < SquaredEpsilon) {
+ a = b = c = 0;
+ return false;
+ }
+ double reciprocal = 1 / normal;
+ a *= reciprocal;
+ b *= reciprocal;
+ c *= reciprocal;
+ return true;
+ }
+
+ void cubicDistanceY(const Cubic& pts, Cubic& distance) {
+ double oneThird = 1 / 3.0;
+ for (int index = 0; index < 4; ++index) {
+ distance[index].x = index * oneThird;
+ distance[index].y = a * pts[index].x + b * pts[index].y + c;
+ }
+ }
+
+ void quadDistanceY(const Quadratic& pts, Quadratic& distance) {
+ double oneHalf = 1 / 2.0;
+ for (int index = 0; index < 3; ++index) {
+ distance[index].x = index * oneHalf;
+ distance[index].y = a * pts[index].x + b * pts[index].y + c;
+ }
+ }
+
+ void controlPtDistance(const Cubic& pts, double distance[2]) {
+ for (int index = 0; index < 2; ++index) {
+ distance[index] = a * pts[index + 1].x + b * pts[index + 1].y + c;
+ }
+ }
+
+ void controlPtDistance(const Cubic& pts, int i, int j, double distance[2]) {
+ distance[0] = a * pts[i].x + b * pts[i].y + c;
+ distance[1] = a * pts[j].x + b * pts[j].y + c;
+ }
+
+ double controlPtDistance(const Quadratic& pts) {
+ return a * pts[1].x + b * pts[1].y + c;
+ }
+
+ double pointDistance(const _Point& pt) {
+ return a * pt.x + b * pt.y + c;
+ }
+private:
+ double a;
+ double b;
+ double c;
+};