Searched refs:a0 (Results 1 - 9 of 9) sorted by relevance

/inkscape/src/2geom/
H A Dbezier-curve.cpp450 static Coord bezier_length_internal(Point a0, Point a1, Point a2, Coord tolerance, int level) argument
452 Coord lower = distance(a0, a2);
453 Coord upper = distance(a0, a1) + distance(a1, a2);
460 // b0 = a0,
462 b1 = 0.5*(a0 + a1),
465 return bezier_length_internal(a0, b1, b2, 0.5 * tolerance, level + 1) +
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
478 Coord lower = distance(a0, 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
254 // a0*x(0)+b0*y(0)=r0 & 2*a0*a(0)+2*b0*b(0)=rr0
257 a0 = r0/dot(v0,V.at0())*v0[0]-rr0/2*v0[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
568 if (a0<0){a0=-a0; c
[all...]
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
503 double a0 = a[0][0]; local
504 if(a0 != 0) {
505 a -= a0;
568 c -= a0; // invert the offset
/inkscape/src/extension/internal/
H A Dpov-out.h105 void segment(int segNr, double a0, double a1,
/inkscape/src/libavoid/
H A Dgeometry.h55 extern bool inValidRegion(bool IgnoreRegions, const Point& a0,
H A Dconnector.cpp1390 Avoid::Point& a0 = conn.ps[cIndex - 2]; local
1392 //db_printf("a0: %g %g\n", a0.x, a0.y);
1395 if ((a0 == b2) || (a0 == b0))
1399 p_dir_back = (a0 == b0) ? true : false;
1703 Avoid::Point& a0 = conn.ps[cIndex - 2]; local
1705 int side1 = Avoid::cornerSide(a0, a1, a2, b0);
1706 int side2 = Avoid::cornerSide(a0, a
[all...]
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
158 int rSide = vecDir(b, a0, a1);
167 if (vecDir(a0, a1, a2) > 0)
/inkscape/share/extensions/
H A Ddxf_input.py92 a0 = (vals[groups['40']][i] - vals[groups['40']][i-2])/(vals[groups['40']][i+1] - vals[groups['40']][i-2])
96 vals[groups['10']][i-2] = (1.0 - a0)*vals[groups['10']][i-3] + a0*vals[groups['10']][i-2]
97 vals[groups['20']][i-2] = (1.0 - a0)*vals[groups['20']][i-3] + a0*vals[groups['20']][i-2]
/inkscape/src/extension/internal/pdfinput/
H A Dpdf-parser.cpp655 double a0 = args[0].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 263 milliseconds