Searched defs:left_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);
79 double left_t,
111 const double Ax = right_t - left_t;
114 solutions.push_back(left_t - Ax*w[0] / Ay);
145 solutions.push_back(r*right_t + (1-r)*left_t);
170 double mid_t = (left_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);
58 double left_t,
64 solutions.push_back(left_t);
86 std::cout << "left_t = " << left_t << std::endl;
90 double new_left_t = left_bound * (right_t - left_t) + left_t;
98 if (left_t < new_left_t) {
117 double left_t, double right_t) const {
119 //convex_hull_marching(bz, bz, solutions, left_t, right_
56 convex_hull_marching(Bezier const &src_bz, Bezier bz, std::vector<double> &solutions, double left_t, double right_t) argument
116 find_bezier_roots(std::vector<double> &solutions, double left_t, double right_t) const argument
152 find_bernstein_roots(Bezier const &bz, unsigned depth, double left_t, double right_t) argument
[all...]

Completed in 14 milliseconds