Searched defs:p1 (Results 1 - 25 of 58) sorted by relevance

123

/inkscape/src/display/
H A Dsp-ctrlcurve.h33 Geom::Point p0, p1, p2, p3; member in struct:SPCtrlCurve
H A Dsp-ctrlquadr.cpp26 Geom::Point p1, p2, p3, p4; member in struct:SPCtrlQuadr
53 ctrlquadr->p1 = Geom::Point(0, 0);
81 Geom::Point p1 = (cq->p1 * cq->affine) - min; local
86 cairo_move_to(buf->ct, p1[Geom::X], p1[Geom::Y]);
90 cairo_line_to(buf->ct, p1[Geom::X], p1[Geom::Y]);
126 Geom::Point p1(cq->p1 * affin
154 sp_ctrlquadr_set_coords(SPCtrlQuadr *cl, Geom::Point p1, Geom::Point p2, Geom::Point p3, Geom::Point p4) argument
[all...]
H A Dsp-ctrlcurve.cpp75 if ( cl->p0 == cl->p1 &&
76 cl->p1 == cl->p2 &&
85 Geom::Point p1 = cl->p1 * cl->affine; local
91 p1[Geom::X] - buf->rect.left(), p1[Geom::Y] - buf->rect.top(),
112 if (cl->p0 == cl->p1 && cl->p1 == cl->p2 && cl->p2 == cl->p3 ) {
117 Geom::Point p1 = cl->p1 * affin local
[all...]
H A Dcurve.cpp235 SPCurve::quadto(Geom::Point const &p1, Geom::Point const &p2) argument
238 else _pathv.back().appendNew<Geom::QuadraticBezier>( p1, p2);
255 SPCurve::curveto(Geom::Point const &p0, Geom::Point const &p1, Geom::Point const &p2) argument
258 else _pathv.back().appendNew<Geom::CubicBezier>( p0, p1, p2 );
H A Ddrawing-context.h60 void curveTo(Geom::Point const &p1, Geom::Point const &p2, Geom::Point const &p3) { argument
61 cairo_curve_to(_ct, p1[Geom::X], p1[Geom::Y], p2[Geom::X], p2[Geom::Y], p3[Geom::X], p3[Geom::Y]);
/inkscape/src/helper/
H A Dmathfns.h25 triangle_area (Geom::Point p1, Geom::Point p2, Geom::Point p3) argument
29 return (p1[X]*p2[Y] + p1[Y]*p3[X] + p2[X]*p3[Y] - p2[Y]*p3[X] - p1[Y]*p2[X] - p1[X]*p3[Y]);
/inkscape/src/
H A Dsp-paint-server.h68 /* Use a pair of pointers for detecting loops: p1 advances half as fast as p2. If there is a
69 loop, then once p1 has entered the loop, we'll detect it the next time the distance between
70 p1 and p2 is a multiple of the loop size. */
71 PaintServer *p1 = src, *p2 = src; local
83 p1 = p1->ref->getObject();
87 if ( p2 == p1 ) {
H A Dline-snapper.cpp38 Geom::Point const p1 = i->second; // point at guide/grid line member in class:Geom
39 Geom::Point const p2 = p1 + Geom::rot90(i->first); // 2nd point at guide/grid line
43 Geom::Point const p_proj = Geom::projection(p.getPoint(), Geom::Line(p1, p2));
48 // For any line that's within range, we will also look at it's "point on line" p1. For guides
51 Geom::Coord const dist_p1 = Geom::L2(p1 - p.getPoint());
53 _addSnappedLinesOrigin(isr, p1, dist_p1, p.getSourceType(), p.getSourceNum(), false);
76 Geom::Point const origin_proj = Geom::projection(origin, Geom::Line(p1, p2));
H A Dline-geometry.cpp215 void create_canvas_line(Geom::Point const &p1, Geom::Point const &p2, guint32 rgba) argument
218 SPCtrlLine *line = ControlManager::getManager().createControlLine(desktop->getControls(), p1, p2);
H A Dunclump.cpp247 Geom::Point p1 = unclump_center (closest); local
250 Geom::Point perp = Geom::rot90(it - p1);
251 Geom::Point p2 = p1 + perp;
253 // get the standard Ax + By + C = 0 form for p1-p2:
254 double A = p1[Geom::Y] - p2[Geom::Y];
255 double B = p2[Geom::X] - p1[Geom::X];
256 double C = p2[Geom::Y] * p1[Geom::X] - p1[Geom::Y] * p2[Geom::X];
272 // different signs, which means item and other are on the different sides of p1-p2 line; skip
/inkscape/src/livarot/
H A DAlphaLigne.h75 static int CmpStep(const void * p1, const void * p2) { argument
76 alpha_step* d1=(alpha_step*)p1;
H A Dint-line.h74 static int CmpBord(void const *p1, void const *p2) { argument
75 int_ligne_bord const *d1 = reinterpret_cast<int_ligne_bord const *>(p1);
/inkscape/src/2geom/
H A Dcairo-path-sink.cpp54 void CairoPathSink::curveTo(Point const &p1, Point const &p2, Point const &p3) argument
56 cairo_curve_to(_cr, p1[X], p1[Y], p2[X], p2[Y], p3[X], p3[Y]);
60 void CairoPathSink::quadTo(Point const &p1, Point const &p2) argument
64 Point q1 = (1./3.) * _current_point + (2./3.) * p1;
65 Point q2 = (2./3.) * p1 + (1./3.) * p2;
H A Dconic_section_clipper_impl.cpp204 double signed_triangle_area (Point const& p1, Point const& p2, Point const& p3) argument
206 return (cross(p2, p3) - cross(p1, p3) + cross(p1, p2));
H A Dgeom.cpp98 intersector_ccw(const Geom::Point& p0, const Geom::Point& p1, argument
102 Geom::Point d1 = p1 - p0;
114 return -1; // p2 < p0 < p1
116 return +1; // p0 <= p1 < p2
118 return 0; // p0 <= p2 <= p1
153 /* true iff ( (the p1 segment straddles the p0 infinite line)
154 * and (the p0 segment straddles the p1 infinite line) ). */
274 * \a p1, \a p1 are distinct points on the line
278 * of \a c0, \a c1 (i.e., the vectors \a r1 - \a r0 and \a p1
282 rect_line_intersect(Geom::Point const &c0, Geom::Point const &c1, Geom::Point const &p0, Geom::Point const &p1) argument
[all...]
H A Dline.cpp182 Point p1 = pointAt(common->min()), p2 = pointAt(common->max()); local
183 LineSegment result(r.clamp(p1), r.clamp(p2));
197 p1 = Point(r[X].max(), (-c - a*r[X].max())/b);
198 if (p1[Y] < r[Y].min())
199 p1 = Point((-c - b*r[Y].min())/a, r[Y].min());
200 if (p1[Y] > r[Y].max())
201 p1 = Point((-c - b*r[Y].max())/a, r[Y].max());
208 p1 = Point((-c - b*r[Y].max())/a, r[Y].max());
209 if (p1[X] < r[X].min())
210 p1
[all...]
H A Dsvg-path-writer.cpp126 void SVGPathWriter::curveTo(Point const &p1, Point const &p2, Point const &p3) argument
128 bool shorthand = _use_shorthands && are_near(p1, _cubic_tangent, _epsilon);
132 _current_pars.push_back(p1[X]);
133 _current_pars.push_back(p1[Y]);
H A Dconicsec.h418 * p1: the inner point of the arc
422 const Point & p1,
428 RatQuad::fromPointsTangents (p0, rot90 (dp0), p1, p2, rot90 (dp2));
421 toRatQuad(const Point & p0, const Point & p1, const Point & p2) const argument
H A Dpoint.h347 inline Point middle_point(Point const &p1, Point const &p2) { argument
348 return lerp(0.5, p1, p2);
396 inline bool are_collinear(Point const& p1, Point const& p2, Point const& p3, argument
399 return are_near( cross(p3, p2) - cross(p3, p1) + cross(p2, p1), 0, eps);
/inkscape/src/ui/tools/
H A Dspiral-tool.cpp368 Geom::Point const p1 = desktop->dt2doc(pt2g); member in class:Inkscape::UI::Tools::Geom
370 Geom::Point const delta = p1 - p0;
H A Dstar-tool.cpp387 Geom::Point const p1 = desktop->dt2doc(pt2g); member in class:Inkscape::UI::Tools::Geom
390 Geom::Point const d = p1 - p0;
/inkscape/src/extension/internal/
H A Dmetafile-print.h60 Geom::Point p1; // center or start member in struct:Inkscape::Extension::Internal::PrintMetafile::GRADVALUES
H A Djavafx-out.cpp546 Geom::Point p1 = points[1]; local
550 out(" controlX1: %s\n", DSTR(p1[X]));
551 out(" controlY1: %s\n", DSTR(p1[Y]));
/inkscape/src/xml/
H A Drepr-util.cpp265 int p1, p2; local
268 p1 = first->position();
287 p1 = to_first->position();
292 if (p1 > p2) return 1;
293 if (p1 < p2) return -1;
/inkscape/src/live_effects/
H A Dlpe-powerstroke-interpolators.h120 Point p1 = points.at(i); local
121 Point dx = Point(p1[X] - p0[X], 0);
122 fit.appendNew<CubicBezier>(p0+_beta*dx, p1-_beta*dx, p1);
152 Point p1 = points.at(i); local
153 Point dx = Point(p1[X] - p0[X], 0);
155 fit.appendNew<CubicBezier>(p0, p1-0.75*dx, p1);
157 fit.appendNew<CubicBezier>(p0+0.75*dx, p1, p1);
229 Point p1 = points[i+1]; local
240 calc_bezier(Point p0, Point p1, Point p2, Point p3) const argument
[all...]

Completed in 1898 milliseconds

123