diff options
| author | Johan B. C. Engelen <jbc.engelen@swissonline.ch> | 2007-08-14 20:54:48 +0000 |
|---|---|---|
| committer | johanengelen <johanengelen@users.sourceforge.net> | 2007-08-14 20:54:48 +0000 |
| commit | 55d43e4e27e0ba58a47fad70957dfa989aa173ad (patch) | |
| tree | 2ccfbac1c50023d08ae32975c876fa2478c1ad2a /src/2geom/solver.h | |
| parent | Fix for bug #1752113; added set_preview_widget_active(false) to FileSaveDialo... (diff) | |
| download | inkscape-55d43e4e27e0ba58a47fad70957dfa989aa173ad.tar.gz inkscape-55d43e4e27e0ba58a47fad70957dfa989aa173ad.zip | |
Commit LivePathEffect branch to trunk!
(disabled extension/internal/bitmap/*.* in build.xml to fix compilation)
(bzr r3472)
Diffstat (limited to 'src/2geom/solver.h')
| -rw-r--r-- | src/2geom/solver.h | 38 |
1 files changed, 38 insertions, 0 deletions
diff --git a/src/2geom/solver.h b/src/2geom/solver.h new file mode 100644 index 000000000..c2e290251 --- /dev/null +++ b/src/2geom/solver.h @@ -0,0 +1,38 @@ +#ifndef _SOLVE_SBASIS_H +#define _SOLVE_SBASIS_H +#include "point.h" +#include "sbasis.h" + +namespace Geom{ + +unsigned +crossing_count(Geom::Point const *V, /* Control pts of Bezier curve */ + unsigned degree); /* Degree of Bezier curve */ +void +find_parametric_bezier_roots( + Geom::Point const *w, /* The control points */ + unsigned degree, /* The degree of the polynomial */ + std::vector<double> & solutions, /* RETURN candidate t-values */ + unsigned depth); /* The depth of the recursion */ + +unsigned +crossing_count(double const *V, /* Control pts of Bezier curve */ + unsigned degree, /* Degree of Bezier curve */ + double left_t, double right_t); +void +find_bernstein_roots( + double *w, /* The control points */ + unsigned degree, /* The degree of the polynomial */ + std::vector<double> & solutions, /* RETURN candidate t-values */ + unsigned depth, /* The depth of the recursion */ + double left_t=0, double right_t=1); +void +find_bernstein_roots_buggy( + double *w, /* The control points */ + unsigned degree, /* The degree of the polynomial */ + std::vector<double> & solutions, /* RETURN candidate t-values */ + unsigned depth, /* The depth of the recursion */ + double left_t=0, double right_t=1); + +}; +#endif |
