Lines Matching defs:left_t
44 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_t);
148 B.find_bernstein_roots(bz, 0, left_t, right_t);
154 double left_t,
157 debug(std::cout << left_t << ", " << right_t << std::endl);
191 const double Ax = right_t - left_t;
194 solutions.push_back(left_t - Ax*bz.at0() / Ay);
199 solutions.push_back(r*right_t + (1-r)*left_t);
205 double split_t = (left_t + right_t) * 0.5;
213 std::vector<double> dsolutions = dbz.roots(Interval(left_t, right_t));
219 split_t = left_t + (right_t - left_t)*dsplit_t;
252 find_bernstein_roots(Left, depth+1, left_t, split_t);