Searched defs:right_t (Results 1 - 2 of 2) sorted by relevance

/inkscape/src/2geom/
H A Dsolve-bezier-one-d.cpp47 double left_t, double right_t);
58 double left_t, double right_t, bool /*use_secant*/)
61 B.find_bernstein_roots(w, depth, left_t, right_t);
67 double left_t, double right_t)
72 B.find_bernstein_roots(w, 0, left_t, right_t);
80 double right_t)
111 const double Ax = right_t - left_t;
145 solutions.push_back(r*right_t + (1-r)*left_t);
170 double mid_t = (left_t + right_t) * 0.5;
182 find_bernstein_roots(Right, depth+1, mid_t, right_t);
54 find_bernstein_roots(double const *w, unsigned degree, std::vector<double> &solutions, unsigned depth, double left_t, double right_t, bool ) argument
65 find_bernstein_roots(std::vector<double> &solutions, Geom::Bezier const &bz, double left_t, double right_t) argument
77 find_bernstein_roots(double const *w, unsigned depth, double left_t, double right_t) argument
[all...]
H A Dsolve-bezier.cpp44 double left_t, double right_t);
59 double right_t)
87 std::cout << "right_t = " << right_t << std::endl;
90 double new_left_t = left_bound * (right_t - left_t) + left_t;
101 new_left_t, right_t);
117 double left_t, double right_t) const {
119 //convex_hull_marching(bz, bz, solutions, left_t, right_t);
148 B.find_bernstein_roots(bz, 0, left_t, right_t);
155 double right_t)
56 convex_hull_marching(Bezier const &src_bz, Bezier bz, std::vector<double> &solutions, double left_t, double right_t) argument
152 find_bernstein_roots(Bezier const &bz, unsigned depth, double left_t, double right_t) argument
[all...]

Completed in 9 milliseconds