| caryclark@google.com | 639df89 | 2012-01-10 21:46:10 +0000 | [diff] [blame^] | 1 | #include "DataTypes.h" |
| 2 | |
| 3 | class Intersections; |
| 4 | |
| 5 | // unit-testable utilities |
| 6 | bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT); |
| 7 | bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT); |
| 8 | void chop_at(const Cubic& src, CubicPair& dst, double t); |
| 9 | void chop_at(const Quadratic& src, QuadraticPair& dst, double t); |
| 10 | int convex_hull(const Cubic& cubic, char order[4]); |
| 11 | bool convex_x_hull(const Cubic& cubic, char connectTo0[2], char connectTo3[2]); |
| 12 | double cube_root(double x); |
| 13 | int cubic_roots(const double coeff[4], double tValues[3]); |
| 14 | bool implicit_matches(const Cubic& cubic1, const Cubic& cubic2); |
| 15 | bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2); |
| 16 | int quadratic_roots(const double coeff[3], double tValues[2]); |
| 17 | void sub_divide(const Cubic& src, double t1, double t2, Cubic& dst); |
| 18 | void sub_divide(const Quadratic& src, double t1, double t2, Quadratic& dst); |
| 19 | void tangent(const Cubic& cubic, double t, _Point& result); |
| 20 | void tangent(const Quadratic& cubic, double t, _Point& result); |
| 21 | |
| 22 | // main functions |
| 23 | enum ReduceOrder_Flags { |
| 24 | kReduceOrder_NoQuadraticsAllowed, |
| 25 | kReduceOrder_QuadraticsAllowed |
| 26 | }; |
| 27 | int reduceOrder(const Cubic& cubic, Cubic& reduction, ReduceOrder_Flags ); |
| 28 | int reduceOrder(const Quadratic& quad, Quadratic& reduction); |
| 29 | bool intersectStart(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); |
| 30 | bool intersectStartT(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); |
| 31 | bool intersectStart(const Quadratic& q1, const Quadratic& q2, Intersections& ); |