Searched refs:p0 (Results 1 - 25 of 44) sorted by relevance

12

/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.h150 Point<T> p0 = midpoint(c0, c1); local
152 Curvature<T> cur(p0, c1, p2);
/inkscape/share/extensions/
H A Dcspsubdiv.py6 p0 = Point(p0x,p0y)
11 s1 = Segment(p0,p3)
21 p0 = sp[i-1][1]
26 b = (p0,p1,p2,p3)
H A Dpathalongpath.py239 p0 = cubicsuperpath.parsePath(d)
241 flipxy(p0)
249 p=copy.deepcopy(p0)
/inkscape/src/display/
H A Dsp-ctrlcurve.cpp75 if ( cl->p0 == cl->p1 &&
84 Geom::Point p0 = cl->p0 * cl->affine; local
89 cairo_move_to (buf->ct, p0[Geom::X] - buf->rect.left(), p0[Geom::Y] - buf->rect.top());
112 if (cl->p0 == cl->p1 && cl->p1 == cl->p2 && cl->p2 == cl->p3 ) {
116 Geom::Point p0 = cl->p0 * affine; local
121 double min_x = p0[Geom::X];
122 double min_y = p0[Geo
[all...]
H A Dsp-ctrlcurve.h33 Geom::Point p0, p1, p2, p3; member in struct:SPCtrlCurve
H A Dcurve.h64 void curveto(Geom::Point const &p0, Geom::Point const &p1, Geom::Point const &p2);
/inkscape/src/live_effects/
H A Dlpe-powerstroke-interpolators.h119 Point p0 = points.at(i-1); local
121 Point dx = Point(p1[X] - p0[X], 0);
122 fit.appendNew<CubicBezier>(p0+_beta*dx, p1-_beta*dx, p1);
151 Point p0 = points.at(i-1); 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);
159 fit.appendNew<CubicBezier>(p0+_beta*dx, p1-_beta*dx, p1);
228 Point p0 = points[i]; local
233 fit.append(calc_bezier(p0, p
240 calc_bezier(Point p0, Point p1, Point p2, Point p3) const argument
[all...]
/inkscape/src/2geom/
H A Dgeom.cpp98 intersector_ccw(const Geom::Point& p0, const Geom::Point& p1, argument
102 Geom::Point d1 = p1 - p0;
103 Geom::Point d2 = p2 - 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) ). */
278 * of \a c0, \a c1 (i.e., the vectors \a r1 - \a r0 and \a p1 - \a p0 point into the same
283 Geom::Point const &p0, Geo
282 rect_line_intersect(Geom::Point const &c0, Geom::Point const &c1, Geom::Point const &p0, Geom::Point const &p1) argument
[all...]
H A Dconicsec.h417 * p0: the initial point of the arc
421 RatQuad toRatQuad (const Point & p0, argument
425 Point dp0 = gradient (p0);
428 RatQuad::fromPointsTangents (p0, rot90 (dp0), p1, p2, rot90 (dp2));
H A Dsbasis.h221 double p0 = 0, p1 = 0;
224 p0 = p0*s + lin[0];
227 return (1-t)*p0 + t*p1;
/inkscape/src/helper/
H A Dgeom.cpp352 Geom::Point &p0) // pass p0 through as it represents the last endpoint added (the finalPoint of last curve)
365 geom_line_wind_distance (p0[X], p0[Y], pe[X], pe[Y], pt, wind, dist);
367 Geom::Rect swept(p0, pe);
369 geom_line_wind_distance (p0[X], p0[Y], pe[X], pe[Y], pt, wind, dist);
372 p0 = pe;
381 Geom::Rect swept(p0, p3);
386 geom_cubic_bbox_wind_distance ( p0[
348 geom_curve_bbox_wind_distance(Geom::Curve const & c, Geom::Affine const &m, Geom::Point const &pt, Geom::Rect *bbox, int *wind, Geom::Coord *dist, Geom::Coord tolerance, Geom::Rect const *viewbox, Geom::Point &p0) argument
[all...]
/inkscape/src/libavoid/
H A Dconnector.cpp593 bool ConnRef::generatePath(Point /*p0*/, Point /*p1*/)
1056 // two shape corners, represented by p0 and p1.
1058 static int midVertexNumber(const Point& p0, const Point& p1, const Point& c) argument
1066 if ((p0.vn >= 4) && (p0.vn < kUnassignedVertexNumber))
1070 return p0.vn;
1078 if ((p0.vn < 4) && (p1.vn < 4))
1080 if (p0.vn != p1.vn)
1082 return p0.vn;
1085 int vn_mid = std::min(p0
1168 Point& p0 = (j == poly.ps.begin()) ? poly.ps.back() : *(j - 1); local
[all...]
H A Dconnector.h315 bool generatePath(Point p0, Point p1);
/inkscape/src/extension/internal/
H A Dpov-out.cpp382 Geom::Point p0 = cit->initialPoint(); local
385 p0[X], p0[Y], p0[X], p0[Y], p1[X], p1[Y], p1[X], p1[Y] );
391 Geom::Point p0 = points[0]; local
396 p0[X],p0[Y], p1[X],p1[Y], p2[X],p2[Y], p3[X],p3[Y]);
H A Demf-print.cpp667 Geom::Point p0(zero * transform);
669 Geom::Point p(p1 - p0);
1537 Geom::Point p0 = pit->initialPoint();
1539 p0[X] = (p0[X] * PX2WORLD);
1540 p0[Y] = (p0[Y] * PX2WORLD);
1542 int32_t const x0 = (int32_t) round(p0[X]);
1543 int32_t const y0 = (int32_t) round(p0[Y]);
1554 //Geom::Point p0
[all...]
/inkscape/src/
H A Dsp-rect.cpp335 Returns the ratio in which the vector from p0 to p1 is stretched by transform
337 gdouble SPRect::vectorStretch(Geom::Point p0, Geom::Point p1, Geom::Affine xform) { argument
338 if (p0 == p1) {
342 return (Geom::distance(p0 * xform, p1 * xform) / Geom::distance(p0, p1));
394 Geom::Point p0 = Geom::Point(this->x.computed, this->y.computed); local
397 return Geom::Rect(p0, p2);
485 Geom::Point p0 = Geom::Point(this->x.computed, this->y.computed) * i2dt; local
491 p.push_back(Inkscape::SnapCandidatePoint(p0, Inkscape::SNAPSOURCE_RECT_CORNER, Inkscape::SNAPTARGET_RECT_CORNER));
498 p.push_back(Inkscape::SnapCandidatePoint((p0
[all...]
H A Dsp-rect.h74 static double vectorStretch(Geom::Point p0, Geom::Point p1, Geom::Affine xform);
H A Dsp-mesh-array.cpp435 Geom::Point p0 = ( (*nodes)[ row + i ][ col ]->p );
437 Geom::Point dp = (p3 - p0)/3.0;
439 (*nodes)[ row + i ][ col + j ]->p = p0 + dp;
443 Geom::Point p0 = ( (*nodes)[ row ][ col + j ]->p );
445 Geom::Point dp = (p3 - p0)/3.0;
447 (*nodes)[ row + i ][ col + j ]->p = p0 + dp;
1240 Geom::Point p0 = sp_star_get_xy( star, SP_STAR_POINT_KNOT1, 0 );
1242 sp_repr_set_svg_double( repr, "x", p0[Geom::X] );
1243 sp_repr_set_svg_double( repr, "y", p0[Geom::Y] );
1322 Geom::Point p0( m
[all...]
/inkscape/src/ui/
H A Dcontrol-manager.h58 SPCtrlCurve *createControlCurve(SPCanvasGroup *parent, Geom::Point const &p0, Geom::Point const &p1, Geom::Point const &p2, Geom::Point const &p3, CtrlLineType type = CTLINE_PRIMARY);
/inkscape/src/ui/tools/
H A Dspiral-tool.cpp367 Geom::Point const p0 = desktop->dt2doc(this->center); member in class:Inkscape::UI::Tools::Geom
370 Geom::Point const delta = p1 - p0;
380 this->spiral->setPosition(p0[Geom::X], p0[Geom::Y],
H A Dstar-tool.cpp386 Geom::Point const p0 = desktop->dt2doc(this->center); member in class:Inkscape::UI::Tools::Geom
390 Geom::Point const d = p1 - p0;
399 sp_star_position_set(this->star, this->magnitude, p0, r1, r1 * this->proportion,
H A Dtext-tool.h73 Geom::Point p0; // initial point if the flowtext rect member in class:Inkscape::UI::Tools::TextTool
/inkscape/src/ui/widget/
H A Ddock-item.h155 static void _signal_drag_end_callback(GtkWidget* self, gboolean p0, void* data);
/inkscape/
H A Dbuildtool.cpp958 int getWord(int p0, String &buf);
960 int getQuoted(int p0, String &buf, int do_i_parse);
962 int parseVersion(int p0);
964 int parseDoctype(int p0);
966 int parseElement(int p0, Element *par,int depth);
1256 int Parser::match(int p0, const char *text) argument
1258 int p = p0;
1262 return p0;
1299 int Parser::getWord(int p0, String &buf) argument
1301 int p = p0;
1313 getQuoted(int p0, String &buf, int do_i_parse) argument
1355 parseVersion(int p0) argument
1394 parseDoctype(int p0) argument
1429 parseElement(int p0, Element *par,int lineNr) argument
2301 match(int p0, const char *key) argument
2320 parseScheme(int p0) argument
2340 parseHierarchicalPart(int p0) argument
2403 parseQuery(int p0) argument
2424 parseFragment(int p0) argument
2447 parse(int p0) argument
[all...]

Completed in 748 milliseconds

12