Searched defs:b1 (Results 1 - 13 of 13) sorted by relevance

/inkscape/src/2geom/
H A Dbezier-curve.cpp462 b1 = 0.5*(a0 + a1), local
464 b2 = 0.5*(b1 + c1); // == c2
465 return bezier_length_internal(a0, b1, b2, 0.5 * tolerance, level + 1) +
488 b1 = 0.5*(a0 + a1), local
491 b2 = 0.5*(b1 + t0),
494 return bezier_length_internal(a0, b1, b2, b3, 0.5 * tolerance, level + 1) +
H A Dsbasis-geometric.cpp251 double a0,a1,b0,b1;// coeffs in a[k] and b[k] local
256 // a1*x(1)+b1*y(1)=r1 & 2*a1*a(1)+2*b1*b(1)=rr1
260 b1 = r1/dot(v1,V.at1())*v1[1]+rr1/2*v1[0];
263 b[k] = Linear(b0,b1);
/inkscape/src/live_effects/
H A Dlpe-ellipse_5pts.cpp148 double b1 = -_det5(mat_b); local
156 {a1, b1/2, d1/2},
157 {b1/2, c1, e1/2},
161 if (_det3(mat_check) == 0 || a1*c1 - b1*b1/4 <= 0) {
166 Geom::Ellipse el(a1, b1, c1, d1, e1, f1);
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)
274 // tan1 = B'(0) = 3 (b1 - p1) --> p1 + (tan1)/3 = b1
278 Point b1 = p1 + tan1 / 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;
481 Cx = a1.x - b1.x;
482 Cy = a1.y - b1.y;
530 const Point& b1, cons
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.cpp1291 Avoid::Point& b1 = poly.ps[(j - 1 + poly_size) % poly_size]; local
1293 //db_printf("b1: %g %g\n", b1.x, b1.y);
1300 const bool a1_eq_b1 = (a1 == b1);
1301 const bool a2_eq_b1 = (a2 == b1);
1343 // The segments share an endpoint -- a1==b1.
1732 (*pointOrders)[b1].addPoints(0,
1733 std::make_pair(&b1, polyConnRef),
1736 (*pointOrders)[b1]
[all...]
/inkscape/src/ui/widget/
H A Dcolor-slider.cpp38 guint b0, guint b1, guint mask);
40 gint step, guint b0, guint b1, guint mask);
536 guint b0, guint b1, guint mask)
569 bg = ((x & mask) ^ (y & mask)) ? b0 : b1;
591 gint step, guint b0, guint b1, guint mask)
619 bg = ((x & mask) ^ (y & mask)) ? b0 : b1;
535 sp_color_slider_render_gradient(gint x0, gint y0, gint width, gint height, gint c[], gint dc[], guint b0, guint b1, guint mask) argument
590 sp_color_slider_render_map(gint x0, gint y0, gint width, gint height, guchar *map, gint start, gint step, guint b0, guint b1, guint mask) argument
H A Dgimpcolorwheel.c1017 gint x1, y1, r1, g1, b1; /* First vertex in scanline order */ local
1050 get_color (priv->h, 1.0, 1.0, &r1, &g1, &b1);
1075 SWAP (b1, b3, t);
1084 SWAP (b1, b2, t);
1106 bl = LERP (b1, b2, y1, y2, y_interp);
1121 br = LERP (b1, b3, y1, y3, y_interp);
/inkscape/src/extension/internal/filter/
H A Dcolor.h625 std::ostringstream b1; local
640 b1 << ((color1 >> 8) & 0xff);
680 "</filter>\n", a1.str().c_str(), r1.str().c_str(), g1.str().c_str(), b1.str().c_str(), swap1.str().c_str(),
/inkscape/src/ui/tools/
H A Dcalligraphic-tool.cpp1071 Geom::Point b1[BEZIER_MAX_LENGTH]; local
1072 gint const nb1 = Geom::bezier_fit_cubic_r(b1, this->point1, this->npoints,
1074 g_assert( nb1 * BEZIER_SIZE <= gint(G_N_ELEMENTS(b1)) );
1089 this->currentcurve->moveto(b1[0]);
1090 for (Geom::Point *bp1 = b1; bp1 < b1 + BEZIER_SIZE * nb1; bp1 += BEZIER_SIZE) {
1099 add_cap(this->currentcurve, b2[0], b1[0], this->cap_rounding);
1106 for (Geom::Point *bp1 = b1; bp1 < b1 + BEZIER_SIZE * nb1; bp1 += BEZIER_SIZE) {
H A Deraser-tool.cpp923 Geom::Point b1[BEZIER_MAX_LENGTH]; local
924 gint const nb1 = Geom::bezier_fit_cubic_r(b1, this->point1, this->npoints, tolerance_sq, BEZIER_MAX_BEZIERS);
925 g_assert( nb1 * BEZIER_SIZE <= gint(G_N_ELEMENTS(b1)) );
940 this->currentcurve->moveto(b1[0]);
942 for (Geom::Point *bp1 = b1; bp1 < b1 + BEZIER_SIZE * nb1; bp1 += BEZIER_SIZE) {
954 add_cap(this->currentcurve, b2[1], b2[0], b1[0], b1[1], this->cap_rounding);
962 for (Geom::Point *bp1 = b1; bp1 < b1
[all...]
/inkscape/src/display/
H A Dcairo-utils.cpp537 Geom::Point b1 = points[0] + (2./3) * (points[1] - points[0]); local
538 Geom::Point b2 = b1 + (1./3) * (points[2] - points[0]);
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.cpp421 bool b1 = false; local
424 b1 = true;
429 // std::cout << " b1: " << (b1?"true":"false")
441 if(b1 || b2) {
467 if(b1 || b2) {
828 Geom::Point b1 = points[0] + (2./3) * (points[1] - points[0]); local
829 Geom::Point b2 = b1 + (1./3) * (points[2] - points[0]);
830 Geom::CubicBezier cub = Geom::CubicBezier(points[0], b1, b2, points[2]);

Completed in 58 milliseconds