Searched refs:a1 (Results 1 - 21 of 21) sorted by relevance

/inkscape/src/libavoid/
H A Dgeometry.cpp148 // shortest paths. a0, a1, a2 are ordered vertices of a shape.
152 bool inValidRegion(bool IgnoreRegions, const Point& a0, const Point& a1, argument
155 // r is a0--a1
156 // s is a1--a2
158 int rSide = vecDir(b, a0, a1);
159 int sSide = vecDir(b, a1, a2);
167 if (vecDir(a0, a1, a2) > 0)
169 // Convex at a1:
188 // Concave at a1:
429 int segmentIntersectPoint(const Point& a1, cons argument
529 rayIntersectPoint(const Point& a1, const Point& a2, const Point& b1, const Point& b2, double *x, double *y) argument
[all...]
H A Dgeometry.h56 const Point& a1, const Point& a2, const Point& b);
118 extern int segmentIntersectPoint(const Point& a1, const Point& a2,
120 extern int rayIntersectPoint(const Point& a1, const Point& a2,
H A Dconnector.cpp1284 Avoid::Point& a1 = conn.ps[cIndex - 1]; local
1286 //db_printf("a1: %g %g\n", a1.x, a1.y);
1300 const bool a1_eq_b1 = (a1 == b1);
1303 const bool a1_eq_b2 = (a1 == b2);
1343 // The segments share an endpoint -- a1==b1.
1705 int side1 = Avoid::cornerSide(a0, a1, a2, b0);
1706 int side2 = Avoid::cornerSide(a0, a1, a2, b2);
1714 crossingPoints->insert(a1);
[all...]
/inkscape/src/2geom/
H A Dbezier-curve.cpp450 static Coord bezier_length_internal(Point a0, Point a1, Point a2, Coord tolerance, int level) argument
453 Coord upper = distance(a0, a1) + distance(a1, a2);
462 b1 = 0.5*(a0 + a1),
463 c1 = 0.5*(a1 + a2),
471 Coord bezier_length(Point a0, Point a1, Point a2, Coord tolerance) argument
473 return bezier_length_internal(a0, a1, a2, tolerance, 0);
476 static Coord bezier_length_internal(Point a0, Point a1, Point a2, Point a3, Coord tolerance, int level) argument
479 Coord upper = distance(a0, a1) + distance(a1, a
500 bezier_length(Point a0, Point a1, Point a2, Point a3, Coord tolerance) argument
[all...]
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
259 a1 = r1/dot(v1,V.at1())*v1[0]-rr1/2*v1[1];
262 a[k] = Linear(a0,a1);
557 * Below are basic functions dedicated to solving this assuming a0 and a1 !=0.
564 double a0=aa0,a1=aa1,c0=cc0,c1=cc1; local
566 bool flip = a1<0;
567 if (a1<0){a1
[all...]
H A Dbezier-utils.cpp415 Point const a1 = b1 * tHat1;
418 C[0][0] += dot(a1, a1);
419 C[0][1] += dot(a1, a2);
429 X[0] += dot(a1, shortfall);
H A Daffine.h229 bool are_near(Affine const &a1, Affine const &a2, Coord eps=EPSILON);
H A Dsbasis.cpp225 // c = {a0*b0 - shift(1, a.Tri*b.Tri), a1*b1 - shift(1, a.Tri*b.Tri)}
442 return a0 + s(a1 + s(a2 +... where s = (1-u)u; ak =(1 - u)a^0_k + ua^1_k
458 return a0 + s(a1 + s(a2 +... where s = (1-u)u; ak =(1 - u)a^0_k + ua^1_k
507 double a1 = a[0][1]; local
508 assert(a1 != 0); // not invertable.
510 if(a1 != 1) {
511 a /= a1;
569 c /= a1; // invert the slope
/inkscape/share/extensions/
H A Ddxf_input.py93 a1 = (vals[groups['40']][i] - vals[groups['40']][i-1])/(vals[groups['40']][i+2] - vals[groups['40']][i-1])
94 vals[groups['10']].insert(i-1, (1.0 - a1)*vals[groups['10']][i-2] + a1*vals[groups['10']][i-1])
95 vals[groups['20']].insert(i-1, (1.0 - a1)*vals[groups['20']][i-2] + a1*vals[groups['20']][i-1])
102 a1 = (vals[groups['40']][i] - vals[groups['40']][i-1])/(vals[groups['40']][i+2] - vals[groups['40']][i-1])
103 vals[groups['10']].insert(i-1, (1.0 - a1)*vals[groups['10']][i-2] + a1*vals[groups['10']][i-1])
104 vals[groups['20']].insert(i-1, (1.0 - a1)*vals[groups['20']][i-2] + a1*val
[all...]
H A Dgcodetools.py570 a1,a2 = bez_split(a,0.5)
572 if bez_bounds_intersect(a1,b1) : recursion(a1,b1, ta0,tam,tb0,tbm, depth_a-1,depth_b-1)
574 if bez_bounds_intersect(a1,b2) : recursion(a1,b2, ta0,tam,tbm,tb1, depth_a-1,depth_b-1)
577 a1,a2 = bez_split(a,0.5)
578 if bez_bounds_intersect(a1,b) : recursion(a1,b, ta0,tam,tb0,tb1, depth_a-1,depth_b)
1357 a1 = tpoint(a[0],a[1],t)
1360 a2 = tpoint(a1,a
[all...]
/inkscape/src/
H A Dunclump.cpp86 double a1 = atan2 ((c2 - c1)[Geom::Y], (c2 - c1)[Geom::X] * wh1[Geom::Y]/wh1[Geom::X]); local
87 a1 = fabs (a1);
88 if (a1 > M_PI/2) a1 = M_PI - a1;
95 double r1 = 0.5 * (wh1[Geom::X] + (wh1[Geom::Y] - wh1[Geom::X]) * (a1/(M_PI/2)));
/inkscape/src/display/
H A Dnr-filter-gaussian.cpp258 double a1=b[0], a2=b[1], a3=b[2]; local
259 double const Mscale = 1.0/((1+a1-a2+a3)*(1-a1-a2-a3)*(1+a2+(a1-a3)*a3));
260 M[0] = 1-a2-a1*a3-sqr(a3);
261 M[1] = (a1+a3)*(a2+a1*a3);
262 M[2] = a3*(a1+a2*a3);
263 M[3] = a1+a2*a3;
264 M[4] = (1-a2)*(a2+a1*a
[all...]
H A Ddrawing-image.cpp170 /** Calculates the closest distance from p to the segment a1-a2*/
172 distance_to_segment (Geom::Point const &p, Geom::Point const &a1, Geom::Point const &a2) argument
174 Geom::LineSegment l(a1, a2);
/inkscape/src/extension/internal/
H A Dpov-out.h105 void segment(int segNr, double a0, double a1,
/inkscape/src/live_effects/
H A Dlpe-ellipse_5pts.cpp147 double a1 = _det5(mat_a); local
156 {a1, b1/2, d1/2},
161 if (_det3(mat_check) == 0 || a1*c1 - b1*b1/4 <= 0) {
166 Geom::Ellipse el(a1, b1, c1, d1, e1, f1);
/inkscape/share/extensions/ink2canvas/
H A Dcanvas.py163 def arc(self, x, y, r, a1, a2, flag):
164 data = (x, y, r, a1, a2, flag)
H A Dsvg.py267 a1 = a([1,0], [(_x1 - _cx) / rx, (_y1 - _cy)/ry])
285 self.ctx.arc(0, 0, r, a1, a1 + ad, 1 - sweepflag)
/inkscape/src/ui/tools/
H A Dcalligraphic-tool.cpp279 double a1; local
286 a1 = atan2(ang1);
289 a1 = 0.0;
295 a1 = atan2(ang1);
308 // flip a2 to force it to be in the same half-circle as a1
310 if (fabs (a2-a1) > 0.5*M_PI) {
321 double new_ang = a1 + (1 - this->flatness) * (a2 - a1) - (flipped? M_PI : 0);
333 // g_print ("force %g acc %g vel_max %g vel %g a1 %g a2 %g new_ang %g\n", Geom::L2(force), Geom::L2(dc->acc), dc->vel_max, Geom::L2(dc->vel), a1, a
[all...]
H A Deraser-tool.cpp227 double a1; local
234 a1 = atan2(ang1);
237 a1 = 0.0;
243 a1 = atan2(ang1);
256 // flip a2 to force it to be in the same half-circle as a1
258 if (fabs (a2-a1) > 0.5*M_PI) {
269 double new_ang = a1 + (1 - this->flatness) * (a2 - a1) - (flipped? M_PI : 0);
281 // g_print ("force %g acc %g vel_max %g vel %g a1 %g a2 %g new_ang %g\n", Geom::L2(force), Geom::L2(dc->acc), dc->vel_max, Geom::L2(dc->vel), a1, a
[all...]
/inkscape/src/extension/internal/filter/
H A Dcolor.h622 std::ostringstream a1; local
649 a1 << (color1 & 0xff) / 255.0F;
654 a1 << (color2 & 0xff) / 255.0F;
659 a1 << (color2 & 0xff) / 255.0F;
664 a1 << (color1 & 0xff) / 255.0F;
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/extension/internal/pdfinput/
H A Dpdf-parser.cpp656 double a1 = args[1].getNum(); local
662 builder->setTransform(a0, a1, a2, a3, a4, a5);
671 double c0 = a0*otherMatrix[0] + a1*otherMatrix[2];
672 double c1 = a0*otherMatrix[1] + a1*otherMatrix[3];
680 builder->setTransform(a0, a1, a2, a3, a4, a5);

Completed in 72 milliseconds