Searched refs:solutions (Results 1 - 7 of 7) sorted by relevance

/inkscape/src/2geom/
H A Dsolver.h54 std::vector<double> & solutions, /* RETURN candidate t-values */
67 std::vector<double> & solutions, /* RETURN candidate t-values */
74 find_bernstein_roots(std::vector<double> &solutions, /* RETURN candidate t-values */
H A Dsolve-bezier-one-d.cpp32 std::vector<double> &solutions; member in class:Geom::Bernsteins
37 : degree(_degree), N(degree+1), solutions(sol), bc(degree)
56 std::vector<double> &solutions, /* RETURN candidate t-values */
60 Bernsteins B(degree, solutions);
65 find_bernstein_roots(std::vector<double> &solutions, /* RETURN candidate t-values */ argument
69 Bernsteins B(bz.degree(), solutions);
101 if (n_crossings == 0) return; // no solutions here
114 solutions.push_back(left_t - Ax*w[0] / Ay);
145 solutions.push_back(r*right_t + (1-r)*left_t);
179 solutions
54 find_bernstein_roots(double const *w, unsigned degree, std::vector<double> &solutions, unsigned depth, double left_t, double right_t, bool ) argument
[all...]
H A Dsolve-bezier.cpp28 std::vector<double> &solutions; member in class:Geom::Bernsteins
32 : solutions(sol)
57 std::vector<double> &solutions,
64 solutions.push_back(left_t);
96 solutions.push_back(new_left_t);
100 solutions,
108 solutions.push_back(new_left_t);
116 Bezier::find_bezier_roots(std::vector<double> &solutions, argument
119 //convex_hull_marching(bz, bz, solutions, left_t, right_t);
130 solutions
56 convex_hull_marching(Bezier const &src_bz, Bezier bz, std::vector<double> &solutions, double left_t, double right_t) argument
[all...]
H A Dsolve-bezier-parametric.cpp38 std::vector<double> &solutions, /* RETURN candidate t-values */
44 case 0: /* No solutions here */
52 solutions.push_back((w[0][Geom::X] + w[degree][Geom::X]) / 2.0);
59 solutions.push_back(compute_x_intercept(w, degree));
73 find_parametric_bezier_roots(Left.data(), degree, solutions, depth+1);
74 find_parametric_bezier_roots(Right.data(), degree, solutions, depth+1);
36 find_parametric_bezier_roots(Geom::Point const *w, unsigned degree, std::vector<double> &solutions, unsigned depth) argument
H A Dbezier.cpp100 std::vector<Coord> solutions; local
101 find_bezier_roots(solutions, 0, 1);
102 std::sort(solutions.begin(), solutions.end());
103 return solutions;
108 std::vector<Coord> solutions; local
109 find_bernstein_roots(&const_cast<std::valarray<Coord>&>(c_)[0], order(), solutions, 0, ivl.min(), ivl.max());
110 std::sort(solutions.begin(), solutions.end());
111 return solutions;
[all...]
H A Dbezier.h138 find_bezier_roots(std::vector<double> & solutions,
/inkscape/src/live_effects/
H A Dlpe-powerstroke.cpp426 std::vector<Geom::ShapeIntersection> solutions; local
427 solutions = circle1.intersect(circle2);
428 if (solutions.size() == 2) {
430 if ( dot(tang2, solutions[0].point() - B[i].at0()) > 0 ) {
432 sol = solutions[1].point();
433 } else if ( dot(tang2, solutions[1].point() - B[i].at0()) > 0 ) { // points[0] could be good, now check points[1]
435 sol = solutions[0].point();
438 sol = ( distanceSq(B[i].at0(), solutions[0].point()) < distanceSq(B[i].at0(), solutions[1].point()) ) ?
439 solutions[
[all...]

Completed in 22 milliseconds