Searched defs:treshhold (Results 1 - 2 of 2) sorted by relevance

/inkscape/src/livarot/
H A DPathConversion.cpp21 void Path::ConvertWithBackData(double treshhold) argument
95 RecCubicTo(curX, nData->start, nextX, nData->end, treshhold, 8, 0.0, 1.0, curP);
105 DoArc(curX, nextX, nData->rx, nData->ry, nData->angle, nData->large, nData->clockwise, treshhold, curP);
145 RecBezierTo(cx, stx, mx, treshhold, 8, 0.0, 1.0, curP + k);
165 RecBezierTo(cx, stx, mx, treshhold, 8, 0.0, 1.0, curP + nbInterm - 1);
184 void Path::Convert(double treshhold) argument
277 RecCubicTo(curX, nData->start, nextX, nData->end, treshhold, 8);
294 DoArc(curX, nextX, nData->rx, nData->ry, nData->angle, nData->large, nData->clockwise, treshhold);
320 RecBezierTo(midX, curX, nextX, treshhold, 8);
351 RecBezierTo(cx, stx, mx, treshhold,
399 ConvertEvenLines(double treshhold) argument
[all...]
H A DPathSimplify.cpp19 * here: walk on the polyline, trying to extend the portion you can fit by respecting the treshhold, split when
20 * treshhold is exceeded. when encountering a "forced" point, lower the treshhold to favor splitting at that point
45 void Path::Simplify(double treshhold) argument
63 DoSimplify(lastM, lastP - lastM, treshhold);
151 void Path::DoSimplify(int off, int N, double treshhold) argument
153 // non-dichotomic method: grow an interval of points approximated by a curve, until you reach the treshhold, and repeat
195 (contains_forced) ? 0.05 * treshhold : treshhold,
212 AttemptSimplify(off + curP, M, treshhold, re
321 ExtendFit(int off, int N, fitting_tables &data, double treshhold, PathDescrCubicTo &res, int &worstP) argument
434 AttemptSimplify(fitting_tables &data,double treshhold, PathDescrCubicTo & res,int &worstP) argument
737 AttemptSimplify(int off, int N, double treshhold, PathDescrCubicTo &res,int &worstP) argument
[all...]

Completed in 13 milliseconds