solver.h

#ifndef _SOLVE_SBASIS_H
#define _SOLVE_SBASIS_H
#include "point.h"
#include "sbasis.h"

namespace Geom{

      class Point;

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 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 */
    double left_t=0, double right_t=1);

};
#endif