Searched refs:n1 (Results 1 - 12 of 12) sorted by relevance

/inkscape/src/2geom/
H A Dgeom.cpp26 * defined by the points p such that dot(n0, p) == d0 and dot(n1, p) == d1.
44 * a = n0.x d = n1.x
45 * b = n0.y e = n1.y
70 Geom::Point const &n1, double const d1,
73 double denominator = dot(Geom::rot90(n0), n1);
74 double X = n1[Geom::Y] * d0 -
76 /* X = (-d1, d0) dot (n0[Y], n1[Y]) */
87 n1[Geom::X] * d0;
174 Geom::Point n1 = (p11 - p10).ccw(); local
175 double d1 = dot(n1,p1
69 line_intersection(Geom::Point const &n0, double const d0, Geom::Point const &n1, double const d1, Geom::Point &result) argument
198 Geom::Point n1 = (p11 - p10).ccw(); local
220 Geom::Point n1 = (p11 - p10).ccw(); local
[all...]
H A Dconicsec.cpp251 Point n0, n1; local
260 n1 = Point(1, b-d);
268 n1 = Point(1, b-d);
276 n1 = Point(b-d, 1);
280 Line L1 = Line::from_origin_and_vector(B0, rot90(n1));
/inkscape/src/live_effects/
H A Dlpe-dynastroke.cpp100 Piecewise<D2<SBasis> > n1,n2; local
135 n1 = n*double(width);
136 n2 =-n1;
151 n1 = nn*double(width);
152 n2 =-n1;
160 n1 = w*n;
161 n2 = -n1;
170 // General formula: n1 = w*u with ||u||=1 and u.v = -dw/dt
175 n1 = -dw*v + ncomp*rot90(v);
176 n1
[all...]
H A Dlpe-envelope.cpp87 Piecewise<D2<SBasis> > n1 = rot90(derivative(uskeleton1)); local
88 n1 = force_continuity(remove_short_cuts(n1,.1));
172 output_y = ybis*(compose((uskeleton1),x1) + y1*compose(n1,x1) )
/inkscape/share/extensions/
H A Dextrude.py55 for n1 in range(0, len(paths)):
56 for n2 in range(n1 + 1, len(paths)):
60 for j in range(0, min(len(pts[n1][i]), len(pts[n2][i]))):
61 comp.append([pts[n1][i][j][1][-2:], pts[n2][i][j][1][-2:]])
H A Dbezmisc.py34 n1 = pow(complex((m-cmath.sqrt(n))/2),1./3)
41 n1 = -pow(-(m-math.sqrt(n))/2,1./3)
43 n1 = pow((m-math.sqrt(n))/2,1./3)
44 x1 = -1./3 * (a + m1 + n1)
45 x2 = -1./3 * (a + w1*m1 + w2*n1)
46 x3 = -1./3 * (a + w2*m1 + w1*n1)
H A Dgcodetools.py1603 n1 = pow(t/2,1./3) if t>=0 else -pow(-t/2,1./3)
1606 n1 = pow(complex((m-cmath.sqrt(n))/2),1./3)
1607 x1 = -1./3 * (a + m1 + n1)
1608 x2 = -1./3 * (a + w1*m1 + w2*n1)
1609 x3 = -1./3 * (a + w2*m1 + w1*n1)
1950 n1 = s1.ccw().unit() if s1.l2()!=0 else (n0.unit()+n3.unit()).unit()
5189 """LT Find angle bisecting the normals n1 and n2
5195 Note that bisect(n1,n2) and bisect(n2,n1) give opposite sinBis2 results
5366 n1
[all...]
/inkscape/src/2geom/numeric/
H A Dmatrix.h324 Matrix(size_t n1, size_t n2) argument
326 m_rows = n1;
328 m_matrix = gsl_matrix_alloc(n1, n2);
331 Matrix(size_t n1, size_t n2, double x) argument
333 m_rows = n1;
335 m_matrix = gsl_matrix_alloc(n1, n2);
456 ConstMatrixView(const base_type & _matrix, size_t k1, size_t k2, size_t n1, size_t n2) argument
457 : m_matrix_view( gsl_matrix_const_submatrix(_matrix.get_gsl_matrix(), k1, k2, n1, n2) )
459 m_rows = n1;
495 MatrixView(base_type & _matrix, size_t k1, size_t k2, size_t n1, size_ argument
[all...]
/inkscape/src/display/
H A Dnr-filter-gaussian.cpp296 int const n1, int const n2, IIRValue const b[N+1], double const M[N*N],
319 PT * dstimg = dest + c2*dstr2 + n1*dstr1;
322 IIRValue iplus[PC]; copy_n(srcimg + (n1-1)*sstr1, PC, iplus);
326 for ( int c1 = 0 ; c1 < n1 ; c1++ ) {
346 int c1=n1-1;
372 int const n1, int const n2, FIRValue const *const kernel, int const scr_len, int const num_threads)
395 for ( int c1 = 0 ; c1 < n1 ; c1++ ) {
431 if (c1_in >= n1) {
432 c1_in = n1 - 1;
458 while(pos + scr_len < n1
294 filter2D_IIR(PT *const dest, int const dstr1, int const dstr2, PT const *const src, int const sstr1, int const sstr2, int const n1, int const n2, IIRValue const b[N+1], double const M[N*N], IIRValue *const tmpdata[], int const num_threads) argument
370 filter2D_FIR(PT *const dst, int const dstr1, int const dstr2, PT const *const src, int const sstr1, int const sstr2, int const n1, int const n2, FIRValue const *const kernel, int const scr_len, int const num_threads) argument
[all...]
/inkscape/src/helper/
H A Dgeom-pathstroke.cpp292 Geom::Point n1 = (circle1.center() - point1).normalized(); // Always points towards center local
294 Geom::Point sum_n = n1 + n2;
304 // std::cout << " norm: " << n1 << "; " << n2 << std::endl;
335 circle1 = Geom::Circle( c1 - dr*n1, r1-dr );
/inkscape/src/
H A Dbox3d.cpp605 Geom::Point n1 = (D - C).ccw(); local
606 double d1 = dot(n1,C);
632 if ((dot(A,n1) < d1) != (dot(B,n1) < d1)) {
/inkscape/
H A Dbuildtool.cpp408 int j2 = j, nj = j, n1, n2 = -1, ni, non_greedy = 0; local
418 if ((n1 = bar(re + i, step, s + j2, s_len - j2, info, bi)) > 0) {
419 j2 += n1;
421 if (re[i + step] == '+' && n1 < 0) break;
432 } while (n1 > 0);
438 if (n1 < 0 && n2 < 0 && re[i + step] == '*' &&
443 DBG(("STAR/PLUS END: %d %d %d %d %d\n", j, nj, re_len - ni, n1, n2));

Completed in 140 milliseconds