Searched defs:p2 (Results 1 - 25 of 53) 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
54 ctrlquadr->p2 = Geom::Point(0, 0);
82 Geom::Point p2 = (cq->p2 * cq->affine) - min; local
87 cairo_line_to(buf->ct, p2[Geom::X], p2[Geom::Y]);
127 Geom::Point p2(cq->p2 * affine);
131 item->x1 = (int)(MIN4(p1[Geom::X], p2[Geom::X], p3[Geom::X], p4[Geom::X]));
132 item->y1 = (int)(MIN4(p1[Geom::Y], p2[Geo
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.cpp76 cl->p1 == cl->p2 &&
77 cl->p2 == cl->p3 )
86 Geom::Point p2 = cl->p2 * cl->affine; local
92 p2[Geom::X] - buf->rect.left(), p2[Geom::Y] - buf->rect.top(),
112 if (cl->p0 == cl->p1 && cl->p1 == cl->p2 && cl->p2 == cl->p3 ) {
118 Geom::Point p2 = cl->p2 * 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/libdepixelize/priv/
H A Dcurvature.h41 Curvature(Point<T> p0, Point<T> c1, Point<T> p2) : argument
42 p0(p0), c1(c1), p2(p2)
67 Point<T> p0, c1, p2; member in struct:Tracer::Curvature
81 return (1-t)*2*(c1.x-p0.x) + t*2*(p2.x-c1.x);
87 return (1-t)*2*(c1.y-p0.y) + t*2*(p2.y-c1.y);
93 return 2 * (p2.x - 2*c1.x + p0.x);
99 return 2 * (p2.y - 2*c1.y + p0.y);
H A Doptimization-kopf2011.h151 Point<T> p2 = midpoint(c1, c2); local
152 Curvature<T> cur(p0, c1, p2);
/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
70 p1 and p2 is a multiple of the loop size. */
71 PaintServer *p1 = src, *p2 = src; local
74 if (match(p2)) {
75 return p2;
78 p2 = p2->ref->getObject();
79 if (!p2) {
80 return p2;
87 if ( p2
[all...]
H A Dline-snapper.cpp39 Geom::Point const p2 = p1 + Geom::rot90(i->first); // 2nd point at guide/grid line member in class:Geom
43 Geom::Point const p_proj = Geom::projection(p.getPoint(), Geom::Line(p1, p2));
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.cpp251 Geom::Point p2 = p1 + perp; local
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
77 alpha_step* d2=(alpha_step*)p2;
H A Dint-line.h74 static int CmpBord(void const *p1, void const *p2) { argument
76 int_ligne_bord const *d2 = reinterpret_cast<int_ligne_bord const *>(p2);
/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
65 Point q2 = (2./3.) * p1 + (1./3.) * p2;
66 // q3 = p2
67 cairo_curve_to(_cr, q1[X], q1[Y], q2[X], q2[Y], p2[X], p2[Y]);
68 _current_point = 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.cpp99 const Geom::Point& p2)
103 Geom::Point d2 = p2 - p0;
114 return -1; // p2 < p0 < p1
116 return +1; // p0 <= p1 < p2
118 return 0; // p0 <= p2 <= p1
98 intersector_ccw(const Geom::Point& p0, const Geom::Point& p1, const Geom::Point& p2) argument
H A Dline.cpp182 Point p1 = pointAt(common->min()), p2 = pointAt(common->max()); local
183 LineSegment result(r.clamp(p1), r.clamp(p2));
H A Dsvg-path-writer.cpp126 void SVGPathWriter::curveTo(Point const &p1, Point const &p2, Point const &p3) argument
135 _current_pars.push_back(p2[X]);
136 _current_pars.push_back(p2[Y]);
141 _cubic_tangent = p3 + (p3 - p2);
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/live_effects/
H A Dlpe-show_handles.cpp189 LPEShowHandles::drawHandleLine(Geom::Point p,Geom::Point p2) argument
193 if(diameter > 0.0 && Geom::distance(p,p2) > (diameter * 0.35)) {
194 Geom::Ray ray2(p, p2);
195 p2 = p2 - Geom::Point::polar(ray2.angle(),(diameter * 0.35));
198 path.appendNew<Geom::LineSegment>( p2 );
H A Dlpe-simplify.cpp286 LPESimplify::drawHandleLine(Geom::Point p,Geom::Point p2) argument
291 if(helper_size > 0 && Geom::distance(p,p2) > (diameter * 0.35)) {
292 Geom::Ray ray2(p, p2);
293 p2 = p2 - Geom::Point::polar(ray2.angle(),(diameter * 0.35));
295 path.appendNew<Geom::LineSegment>( p2 );
H A Dlpe-powerstroke-interpolators.h230 Point p2 = points[i+2]; local
233 fit.append(calc_bezier(p0, p1, p2, p3));
240 CubicBezier calc_bezier(Point p0, Point p1, Point p2, Point p3) const { argument
241 // create interpolating bezier between p1 and p2
251 double dt1 = powf(distanceSq(p1, p2), 0.25);
252 double dt2 = powf(distanceSq(p2, p3), 0.25);
265 Point tan1 = (p1 - p0) / dt0 - (p2 - p0) / (dt0 + dt1) + (p2 - p1) / dt1;
266 Point tan2 = (p2 - p1) / dt1 - (p3 - p1) / (dt1 + dt2) + (p3 - p2) / dt
[all...]
/inkscape/src/extension/internal/
H A Dmetafile-print.h61 Geom::Point p2; // xhandle or end member in struct:Inkscape::Extension::Internal::PrintMetafile::GRADVALUES
/inkscape/src/xml/
H A Drepr-util.cpp265 int p1, p2; local
269 p2 = second->position();
288 p2 = to_second->position();
292 if (p1 > p2) return 1;
293 if (p1 < p2) return -1;

Completed in 1533 milliseconds

123