Cross Reference: /inkscape/src/livarot/PathSimplify.cpp

Lines Matching refs:Yk
161     data.Xk = data.Yk = data.Qk = NULL;
232     g_free(data.Yk);
247 // primitive= calc the cubic bezier patche that fits Xk and Yk best
251                     double *Xk, double *Yk, double *Qk, double *tk, int nbPt)
277     Yk[0] = start[1];
279     Yk[nbPt - 1] = end[1];
300         Qk[i] = Yk[i] - N03 (tk[i]) * Yk[0] - N33 (tk[i]) * Yk[nbPt - 1];
326         data.Yk = (double *) g_realloc(data.Yk, data.maxPt * sizeof(double));
336             data.Yk[i] = pts[off + i].p[Geom::Y];
351             diff[Geom::Y] = data.Yk[i] - data.Yk[i - 1];
390     res.p[1] = data.Yk[data.nbPt - 1];
403         start[1] = data.Yk[0];
408             nPt[1] = data.Yk[i];
446     start[1] = data.Yk[0];
448     cp1[1] = data.Yk[1];
450     end[1] = data.Yk[data.nbPt - 1];
461     if ( FitCubic(start, res, data.Xk, data.Yk, data.Qk, data.tk, data.nbPt) ) {
471             nPt[Geom::Y] = data.Yk[i];
498         prevP[Geom::Y] = data.Yk[0];
518                     N03(data.tk[i]) * data.Yk[0] +
519                     N33(data.tk[i]) * data.Yk[data.nbPt - 1];
522                 curP[Geom::Y] = data.Yk[i];
532                     N03(mtk) * data.Yk[0] +
533                     N33(mtk) * data.Yk[data.nbPt - 1];
570                     N03(data.tk[i]) * data.Yk[0] +
571                     N33(data.tk[i]) * data.Yk[data.nbPt - 1];
574                 curP[Geom::Y] = data.Yk[i];
601             Geom::Point pt(data.Xk[i], data.Yk[i]);
609         if ( FitCubic(start, res, data.Xk, data.Yk, data.Qk, data.tk, data.nbPt) == false) {
621             Geom::Point prevP(data.Xk[0], data.Yk[0]);
641                         N03(data.tk[i]) * data.Yk[0] +
642                         N33(data.tk[i]) * data.Yk[data.nbPt - 1];
645                     curP[Geom::Y] = data.Yk[i];
655                         N03(mtk) * data.Yk[0] +
656                         N33(mtk) * data.Yk[data.nbPt - 1];
695                         N03(data.tk[i]) * data.Yk[0] +
696                         N33(data.tk[i]) * data.Yk[data.nbPt - 1];
699                     curP[Geom::Y] = data.Yk[i];
744     double *Yk;				// la coordonnee traitee (x puis y)
777     Yk = (double *) g_malloc(N * sizeof(double));
788             Yk[i] = pts[off + i].p[Geom::Y];
796             Geom::Point diff(Xk[i] - prevP[Geom::X], Yk[i] - prevP[1]);
798             prevP[1] = Yk[i];
814             nPt[1] = Yk[i];
834         g_free(Yk);
847     if ( FitCubic(start, res, Xk, Yk, Qk, tk, N) ) {
857             Geom::Point nPt(Xk[i], Yk[i]);
877         g_free(Yk);
892     prevP[1] = Yk[0];
907         curAppP[1] = N13 (tk[i]) * cp1[1] + N23 (tk[i]) * cp2[1] + N03 (tk[i]) * Yk[0] + N33 (tk[i]) * Yk[N - 1];
909         curP[1] = Yk[i];
911         midAppP[1] = N13 (0.5*(tk[i]+tk[i-1])) * cp1[1] + N23 (0.5*(tk[i]+tk[i-1])) * cp2[1] + N03 (0.5*(tk[i]+tk[i-1])) * Yk[0] + N33 (0.5*(tk[i]+tk[i-1])) * Yk[N - 1];
944         curAppP[1] = N13 (tk[i]) * cp1[1] + N23 (tk[i]) * cp2[1] + N03 (tk[i]) * Yk[0] + N33 (tk[i]) * Yk[N - 1];
946         curP[1] = Yk[i];
981       pt[1] = Yk[i];
990     if ( FitCubic(start,res,Xk,Yk,Qk,tk,N) ) {
998       g_free(Yk);
1011       prevP[1] = Yk[0];
1026           curAppP[1] = N13 (tk[i]) * cp1[1] + N23 (tk[i]) * cp2[1] + N03 (tk[i]) * Yk[0] + N33 (tk[i]) * Yk[N - 1];
1028           curP[1] = Yk[i];
1030           midAppP[1] = N13 (0.5*(tk[i]+tk[i-1])) * cp1[1] + N23 (0.5*(tk[i]+tk[i-1])) * cp2[1] + N03 (0.5*(tk[i]+tk[i-1])) * Yk[0] + N33 (0.5*(tk[i]+tk[i-1])) * Yk[N - 1];
1062           curAppP[1] = N13 (tk[i]) * cp1[1] + N23 (tk[i]) * cp2[1] + N03 (tk[i]) * Yk[0] + N33 (tk[i]) * Yk[N - 1];
1064           curP[1]=Yk[i];
1090     g_free(Yk);
1110   g_free(Yk);