Searched defs:e2 (Results 1 - 5 of 5) sorted by relevance
/inkscape/src/2geom/ |
H A D | elliptical-arc-from-sbasis.cpp | 90 double e1x, double e1y, double e2 ); 213 double e1x, double e1y, double e2 ) 216 dist_bound = std::fabs( e1x * p[k][X] + e1y * p[k][Y] + e2 ); 238 double e2 = ((D + E) + (A + B + C) * tol_at_extr) * tol_at_extr; local 239 if (bound_exceeded(0, ee, e1x, e1y, e2)) 244 if (bound_exceeded(0, ee, e1x, e1y, e2)) 254 // e2 = ee(tolerance, tolerance) - F; 255 e2 = ((D + E) + (A + B + C) * tolerance) * tolerance; 258 // std::cerr << "e2 = " << e2 << st [all...] |
/inkscape/src/libavoid/ |
H A D | geometry.cpp | 116 // Returns true if the segment e1-e2 intersects the shape boundary 119 bool segmentShapeIntersect(const Point& e1, const Point& e2, const Point& s1, argument 122 if (segmentIntersect(e1, e2, s1, s2)) 128 (vecDir(s1, s2, e2) != 0)) 130 (((s2 == e2) || pointOnLine(s1, s2, e2)) &&
|
H A D | visibility.cpp | 459 Point &e2 = (*closestIt).vInf2->point; local 466 e2.x + canx, e2.y + cany, 0, 0, 225, 255);
|
H A D | router.cpp | 864 Point e2 = points.second; local 871 inPoly(poly, e2, countBorder) : false; 885 if (segmentShapeIntersect(e1, e2, pi, pn, 1091 double e1, e2; local 1230 e2 = euclideanDist(xp, end); 1231 estdist = e1 + e2; 1239 // e1, e2);
|
/inkscape/src/ui/dialog/ |
H A D | filter-effects-dialog.cpp | 2462 double e2 = ( e->x - vis_x2/2); local 2464 if(e2 < vis_x) 2465 _autoscroll_x = -(int)(speed + (vis_x - e2) / 5); 2466 else if(e2 < vis_x + limit) 2468 else if(e2 > right_edge) 2469 _autoscroll_x = (int)(speed + (e2 - right_edge) / 5); 2470 else if(e2 > right_edge - limit)
|
Completed in 36 milliseconds