Searched defs:Ax (Results 1 - 6 of 6) sorted by relevance
/inkscape/src/2geom/ |
H A D | solve-bezier-one-d.cpp | 111 const double Ax = right_t - left_t; local 114 solutions.push_back(left_t - Ax*w[0] / Ay);
|
H A D | solve-bezier.cpp | 191 const double Ax = right_t - left_t; local 194 solutions.push_back(left_t - Ax*bz.at0() / Ay);
|
H A D | basic-intersection.cpp | 411 Point Ax = A.at0(); local 412 double t = Geom::nearest_time(Ax, B); 413 dist = Geom::distance(Ax, B(t)); 419 Ax = A.at1(); 420 t = Geom::nearest_time(Ax, B); 421 dist = Geom::distance(Ax, B(t));
|
/inkscape/src/libavoid/ |
H A D | geometry.cpp | 432 double Ax,Bx,Cx,Ay,By,Cy,d,e,f,num; local 435 Ax = a2.x - a1.x; 439 if (Ax < 0) 486 f = Ay*Bx - Ax*By; 498 e = Ax*Cy - Ay*Cx; 514 num = d*Ax; 532 double Ax,Bx,Cx,Ay,By,Cy,d,f,num; local 536 Ax = a2.x - a1.x; 544 f = Ay*Bx - Ax*By; 551 num = d*Ax; [all...] |
/inkscape/src/livarot/ |
H A D | PathSimplify.cpp | 1121 double const Ax = pt[Geom::X] - local 1147 double const dF = -6 * (Ax * Bx + Ay * By); 1148 double const ddF = 18 * (Bx * Bx + By * By) - 12 * (Ax * Cx + Ay * Cy);
|
/inkscape/src/helper/ |
H A D | geom.cpp | 205 Geom::Coord Ax, Ay, Bx, By, Dx, Dy, s; local 209 Ax = x0; 219 s = ((Px - Ax) * Dx + (Py - Ay) * Dy) / (Dx * Dx + Dy * Dy); 221 dist2 = (Px - Ax) * (Px - Ax) + (Py - Ay) * (Py - Ay); 226 Qx = Ax + s * Dx; 236 if ((Ax >= Px) && (Bx >= Px)) return; 242 if (Ax < Px) *wind -= 1; 250 Qx = Ax + Dx * (Py - Ay) / Dy;
|
Completed in 29 milliseconds