Cross Reference: /inkscape/src/2geom/solve-bezier-parametric.cpp

Lines Matching refs:degree
19 crossing_count(Geom::Point const *V, unsigned degree);
21 control_poly_flat_enough(Geom::Point const *V, unsigned degree);
23 compute_x_intercept(Geom::Point const *V, unsigned degree);
37                   unsigned degree,	/* The degree of the polynomial */
42     const unsigned max_crossings = crossing_count(w, degree);
52             solutions.push_back((w[0][Geom::X] + w[degree][Geom::X]) / 2.0);
58         if (control_poly_flat_enough(w, degree)) {
59             solutions.push_back(compute_x_intercept(w, degree));
67     //Geom::Point Left[degree+1],	/* New left and right  */
68     //    Right[degree+1];	/* control polygons  */
69     std::vector<Geom::Point> Left( degree+1 ), Right(degree+1);
71     casteljau_subdivision(0.5, w, Left.data(), Right.data(), degree);
73     find_parametric_bezier_roots(Left.data(),  degree, solutions, depth+1);
74     find_parametric_bezier_roots(Right.data(), degree, solutions, depth+1);
86 	       unsigned degree)	/*  Degree of Bezier curve 	*/
91     for (unsigned i = 1; i <= degree; i++) {
110 			 unsigned degree)	/* Degree of polynomial	*/
113      * V[degree] */
117     const double a = V[0][Geom::Y] - V[degree][Geom::Y];
118     const double b = V[degree][Geom::X] - V[0][Geom::X];
119     const double c = V[0][Geom::X] * V[degree][Geom::Y] - V[degree][Geom::X] * V[0][Geom::Y];
123     //double distance[degree]; /* Distances from pts to line */
124     std::vector<double> distance(degree); /* Distances from pts to line */
125     for (unsigned i = 1; i < degree; i++) {
138     for (unsigned i = 0; i < degree-1; i++) {
171 		    unsigned degree) /*  Degree of curve	*/
173     const Geom::Point A = V[degree] - V[0];