Searched defs:b2 (Results 1 - 10 of 10) sorted by relevance

/inkscape/src/2geom/
H A Dbezier-curve.cpp464 b2 = 0.5*(b1 + c1); // == c2 local
465 return bezier_length_internal(a0, b1, b2, 0.5 * tolerance, level + 1) +
466 bezier_length_internal(b2, c1, a2, 0.5 * tolerance, level + 1);
491 b2 = 0.5*(b1 + t0), local
493 b3 = 0.5*(b2 + c2); // == c3
494 return bezier_length_internal(a0, b1, b2, b3, 0.5 * tolerance, level + 1) +
/inkscape/src/live_effects/
H A Dlpe-powerstroke-interpolators.h272 // the tangent of a bezier curve is: B'(t) = 3(1-t)^2 (b1 - b0) + 6(1-t)t(b2-b1) + 3t^2(b3-b2)
275 // tan2 = B'(1) = 3 (p2 - b2) --> p2 - (tan2)/3 = b2
279 Point b2 = p2 - tan2 / 3; local
282 return CubicBezier(b0, b1, b2, b3);
/inkscape/src/libavoid/
H A Dgeometry.cpp430 const Point& b1, const Point& b2, double *x, double *y)
436 Bx = b1.x - b2.x;
451 if (x1hi < b2.x || b1.x < x1lo) return DONT_INTERSECT;
455 if (x1hi < b1.x || b2.x < x1lo) return DONT_INTERSECT;
459 By = b1.y - b2.y;
474 if (y1hi < b2.y || b1.y < y1lo) return DONT_INTERSECT;
478 if (y1hi < b1.y || b2.y < y1lo) return DONT_INTERSECT;
530 const Point& b1, const Point& b2, double *x, double *y)
535 By = b1.y - b2.y;
537 Bx = b1.x - b2
429 segmentIntersectPoint(const Point& a1, const Point& a2, const Point& b1, const Point& b2, double *x, double *y) argument
529 rayIntersectPoint(const Point& a1, const Point& a2, const Point& b1, const Point& b2, double *x, double *y) argument
[all...]
H A Dconnector.cpp1292 Avoid::Point& b2 = poly.ps[j]; local
1294 //db_printf("b2: %g %g\n", b2.x, b2.y);
1302 const bool a2_eq_b2 = (a2 == b2);
1303 const bool a1_eq_b2 = (a1 == b2);
1351 // If here and not converging, then we know that a2 != b2
1395 if ((a0 == b2) || (a0 == b0))
1706 int side2 = Avoid::cornerSide(a0, a1, a2, b2);
1745 int turnDirB = vecDir(b0, b1, b2);
[all...]
/inkscape/src/extension/internal/filter/
H A Dcolor.h629 std::ostringstream b2; local
643 b2 << ((color2 >> 8) & 0xff);
681 a2.str().c_str(), r2.str().c_str(), g2.str().c_str(), b2.str().c_str(), swap2.str().c_str(),
/inkscape/src/ui/tools/
H A Dcalligraphic-tool.cpp1076 Geom::Point b2[BEZIER_MAX_LENGTH]; local
1077 gint const nb2 = Geom::bezier_fit_cubic_r(b2, this->point2, this->npoints,
1079 g_assert( nb2 * BEZIER_SIZE <= gint(G_N_ELEMENTS(b2)) );
1093 this->currentcurve->lineto(b2[BEZIER_SIZE*(nb2-1) + 3]);
1094 for (Geom::Point *bp2 = b2 + BEZIER_SIZE * ( nb2 - 1 ); bp2 >= b2; bp2 -= BEZIER_SIZE) {
1099 add_cap(this->currentcurve, b2[0], b1[0], this->cap_rounding);
1109 for (Geom::Point *bp2 = b2; bp2 < b2 + BEZIER_SIZE * nb2; bp2 += BEZIER_SIZE) {
H A Deraser-tool.cpp927 Geom::Point b2[BEZIER_MAX_LENGTH]; local
928 gint const nb2 = Geom::bezier_fit_cubic_r(b2, this->point2, this->npoints, tolerance_sq, BEZIER_MAX_BEZIERS);
929 g_assert( nb2 * BEZIER_SIZE <= gint(G_N_ELEMENTS(b2)) );
946 this->currentcurve->lineto(b2[BEZIER_SIZE*(nb2-1) + 3]);
948 for (Geom::Point *bp2 = b2 + BEZIER_SIZE * ( nb2 - 1 ); bp2 >= b2; bp2 -= BEZIER_SIZE) {
954 add_cap(this->currentcurve, b2[1], b2[0], b1[0], b1[1], this->cap_rounding);
966 for (Geom::Point *bp2 = b2; bp2 < b2
[all...]
/inkscape/src/display/
H A Dcairo-utils.cpp538 Geom::Point b2 = b1 + (1./3) * (points[2] - points[0]); local
540 cairo_curve_to(cr, b1[X], b1[Y], b2[X], b2[Y], points[2][X], points[2][Y]);
545 cairo_curve_to(cr, b1[X], b1[Y], b2[X], b2[Y], points[2][X], points[2][Y]);
/inkscape/src/helper/
H A Dgeom-pathstroke.cpp422 bool b2 = false; local
427 b2 = true;
430 // << " b2: " << (b2?"true":"false") << std::endl;
441 if(b1 || b2) {
467 if(b1 || b2) {
829 Geom::Point b2 = b1 + (1./3) * (points[2] - points[0]); local
830 Geom::CubicBezier cub = Geom::CubicBezier(points[0], b1, b2, points[2]);
/inkscape/src/ui/widget/
H A Dgimpcolorwheel.c1018 gint x2, y2, r2, g2, b2; /* Second vertex */ local
1054 get_color (priv->h, 1.0, 0.0, &r2, &g2, &b2);
1066 SWAP (b2, b3, t);
1084 SWAP (b1, b2, t);
1106 bl = LERP (b1, b2, y1, y2, y_interp);
1114 bl = LERP (b2, b3, y2, y3, y_interp);

Completed in 47 milliseconds