Searched defs:bz (Results 1 - 4 of 4) sorted by relevance
| /inkscape/src/2geom/ |
| H A D | sbasis-to-bezier.cpp | 101 void sbasis_to_bezier (Bezier & bz, SBasis const& sb, size_t sz) argument
128 bz.clear();
129 bz.resize(n+1);
136 bz[j] += (Tjk * sb[k][0]);
137 bz[n-j] += (Tjk * sb[k][1]); // n-k <-> [k][1]
142 bz[q] += sb[q][0];
148 bz[j] /= binomial(n, j);
150 bz[0] = sb[0][0];
151 bz[n] = sb[0][1];
154 void sbasis_to_bezier(D2<Bezier> &bz, D argument
169 sbasis_to_bezier(std::vector<Point> & bz, D2<SBasis> const& sb, size_t sz) argument
185 sbasis_to_cubic_bezier(std::vector<Point> & bz, D2<SBasis> const& sb) argument
320 bezier_to_sbasis(SBasis & sb, Bezier const& bz) argument
366 bezier_to_sbasis(D2<SBasis> & sb, std::vector<Point> const& bz) argument
[all...] |
| H A D | solve-bezier-one-d.cpp | 66 Geom::Bezier const &bz, /* The control points */
69 Bernsteins B(bz.degree(), solutions);
70 Geom::Bezier& bzl = const_cast<Geom::Bezier&>(bz);
65 find_bernstein_roots(std::vector<double> &solutions, Geom::Bezier const &bz, double left_t, double right_t) argument
|
| H A D | solve-bezier.cpp | 40 double secant(Bezier const &bz);
43 void find_bernstein_roots(Bezier const &bz, unsigned depth,
56 void convex_hull_marching(Bezier const &src_bz, Bezier bz, argument
61 while(bz.order() > 0 && bz[0] == 0) {
63 bz = bz.deflate();
66 if (bz.order() > 0) {
68 int old_sign = SGN(bz[0]);
72 for (size_t i = 1; i < bz
118 Bezier bz = *this; local
152 find_bernstein_roots(Bezier const &bz, unsigned depth, double left_t, double right_t) argument
257 secant(Bezier const &bz) argument
[all...] |
| H A D | sbasis-roots.cpp | 623 Bezier bz; local
624 sbasis_to_bezier(bz, s);
625 return bz.roots();
638 Bezier bz; local
639 sbasis_to_bezier(bz, s);
640 return bz.roots(ivl);
|
Completed in 21 milliseconds