/inkscape/src/display/ |
H A D | sp-ctrlcurve.h | 33 Geom::Point p0, p1, p2, p3; member in struct:SPCtrlCurve
|
H A D | sp-ctrlquadr.cpp | 26 Geom::Point p1, p2, p3, p4; member in struct:SPCtrlQuadr 55 ctrlquadr->p3 = Geom::Point(0, 0); 83 Geom::Point p3 = (cq->p3 * cq->affine) - min; local 88 cairo_line_to(buf->ct, p3[Geom::X], p3[Geom::Y]); 128 Geom::Point p3(cq->p3 * 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[Geom::Y], p3[Geo 154 sp_ctrlquadr_set_coords(SPCtrlQuadr *cl, Geom::Point p1, Geom::Point p2, Geom::Point p3, Geom::Point p4) argument [all...] |
H A D | sp-ctrlcurve.cpp | 77 cl->p2 == cl->p3 ) 87 Geom::Point p3 = cl->p3 * cl->affine; local 93 p3[Geom::X] - buf->rect.left(), p3[Geom::Y] - buf->rect.top() ); 112 if (cl->p0 == cl->p1 && cl->p1 == cl->p2 && cl->p2 == cl->p3 ) { 119 Geom::Point p3 = cl->p3 * affine; local 136 min_x = MIN( min_x, p3[Geom::X] ); 137 min_y = MIN( min_y, p3[Geo [all...] |
H A D | drawing-context.h | 60 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 D | mathfns.h | 25 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]);
|
H A D | geom.cpp | 378 Geom::Point p3 = cubic_bezier[3] * m; local 381 Geom::Rect swept(p0, p3); 389 p3[X], p3[Y], 394 geom_line_wind_distance (p0[X], p0[Y], p3[X], p3[Y], pt, wind, dist); 398 p0 = p3; 732 // p1,p2,p4 are collinear, p3 is significant 766 // p1,p3,p4 are collinear, p2 is significant
|
/inkscape/src/2geom/ |
H A D | cairo-path-sink.cpp | 54 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]); 57 _current_point = p3;
|
H A D | conic_section_clipper_impl.cpp | 204 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 D | svg-path-writer.cpp | 126 void SVGPathWriter::curveTo(Point const &p1, Point const &p2, Point const &p3) argument 137 _current_pars.push_back(p3[X]); 138 _current_pars.push_back(p3[Y]); 140 _current = _quad_tangent = p3; 141 _cubic_tangent = p3 + (p3 - p2);
|
H A D | point.h | 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);
|
H A D | conicsec.cpp | 691 double signed_triangle_area (Point const& p1, Point const& p2, Point const& p3) argument 693 return (cross(p2, p3) - cross(p1, p3) + cross(p1, p2));
|
/inkscape/src/extension/internal/ |
H A D | metafile-print.h | 62 Geom::Point p3; // yhandle or unused member in struct:Inkscape::Extension::Internal::PrintMetafile::GRADVALUES
|
H A D | javafx-out.cpp | 548 Geom::Point p3 = points[3]; local 554 out(" x: %s\n", DSTR(p3[X])); 555 out(" y: %s\n", DSTR(p3[Y]));
|
H A D | pov-out.cpp | 394 Geom::Point p3 = points[3]; local 396 p0[X],p0[Y], p1[X],p1[Y], p2[X],p2[Y], p3[X],p3[Y]);
|
H A D | wmf-print.cpp | 694 Geom::Point yv = gv.p3 - gv.p1; // Y' vector 990 Geom::Point p3 = points[3]; local 995 p3[X] = (p3[X] * PX2WORLD); 999 p3[Y] = (p3[Y] * PX2WORLD); 1007 int32_t const x3 = (int32_t) round(p3[X]); 1008 int32_t const y3 = (int32_t) round(p3[Y]);
|
H A D | emf-print.cpp | 1186 Geom::Point yv = gv.p3 - gv.p1; // Y' vector 1575 Geom::Point p3 = points[3]; local 1580 p3[X] = (p3[X] * PX2WORLD); 1584 p3[Y] = (p3[Y] * PX2WORLD); 1592 int32_t const x3 = (int32_t) round(p3[X]); 1593 int32_t const y3 = (int32_t) round(p3[Y]); 1864 Geom::Point p3 = points[3]; local 1869 p3[ [all...] |
/inkscape/src/live_effects/ |
H A D | lpe-powerstroke-interpolators.h | 231 Point p3 = (i < n_points-3) ? points[i+3] : 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 { 252 double dt2 = powf(distanceSq(p2, p3), 0.25); 266 Point tan2 = (p2 - p1) / dt1 - (p3 - p1) / (dt1 + dt2) + (p3 - p2) / dt2;
|
H A D | lpe-copy_rotate.cpp | 48 pointInTriangle(Geom::Point const &p, Geom::Point const &p1, Geom::Point const &p2, Geom::Point const &p3) argument 53 double denominator = (p1[X]*(p2[Y] - p3[Y]) + p1[Y]*(p3[X] - p2[X]) + p2[X]*p3[Y] - p2[Y]*p3[X]); 54 double t1 = (p[X]*(p3[Y] - p1[Y]) + p[Y]*(p1[X] - p3[X]) - p1[X]*p3[Y] + p1[Y]*p3[X]) / denominator;
|
H A D | lpe-taperstroke.cpp | 354 Geom::Path p3 = path_in[0].portion(endTime, path_in[0].size()); local 359 out.push_back(p3);
|
/inkscape/src/ |
H A D | sp-rect.cpp | 488 Geom::Point p3 = Geom::Point(this->x.computed + this->width.computed, this->y.computed) * i2dt; local 494 p.push_back(Inkscape::SnapCandidatePoint(p3, Inkscape::SNAPSOURCE_RECT_CORNER, Inkscape::SNAPTARGET_RECT_CORNER)); 500 p.push_back(Inkscape::SnapCandidatePoint((p2 + p3)/2, Inkscape::SNAPSOURCE_LINE_MIDPOINT, Inkscape::SNAPTARGET_LINE_MIDPOINT)); 501 p.push_back(Inkscape::SnapCandidatePoint((p3 + p0)/2, Inkscape::SNAPSOURCE_LINE_MIDPOINT, Inkscape::SNAPTARGET_LINE_MIDPOINT));
|
H A D | gradient-drag.cpp | 1873 * Create a curve from p0 to p3 and add it to the lines list. Used for mesh sides. 1875 void GrDrag::addCurve(SPItem *item, Geom::Point p0, Geom::Point p1, Geom::Point p2, Geom::Point p3, Inkscape::PaintTarget fill_or_stroke) argument 1878 SPCtrlCurve *line = ControlManager::getManager().createControlCurve(this->desktop->getControls(), p0, p1, p2, p3, type);
|
/inkscape/src/ui/ |
H A D | control-manager.cpp | 408 SPCtrlCurve *ControlManager::createControlCurve(SPCanvasGroup *parent, Geom::Point const &p0, Geom::Point const &p1, Geom::Point const &p2, Geom::Point const &p3, CtrlLineType type) argument 416 line->setCoords(p0, p1, p2, p3);
|
/inkscape/src/libavoid/ |
H A D | makepath.cpp | 117 // points p1--p2 and p2--p3. Return value is in radians. 119 static double angleBetween(const Point& p1, const Point& p2, const Point& p3) argument 121 if ((p1.x == p2.x && p1.y == p2.y) || (p2.x == p3.x && p2.y == p3.y)) 129 Point v2(p3.x - p2.x, p3.y - p2.y); 181 Point p3 = inf3->point; local 183 double rad = M_PI - angleBetween(p1, p2, p3);
|
/inkscape/src/livarot/ |
H A D | PathSimplify.cpp | 1116 double Path::RaffineTk (Geom::Point pt, Geom::Point p0, Geom::Point p1, Geom::Point p2, Geom::Point p3, double it) argument 1125 p3[Geom::X] * N33(it); 1129 (p3[Geom::X] - p2[Geom::X]) * N22(it); 1132 (p3[Geom::X] - 2 * p2[Geom::X] + p1[Geom::X]) * N11(it); 1138 p3[Geom::Y] * N33(it); 1142 (p3[Geom::Y] - p2[Geom::Y]) * N22(it); 1145 (p3[Geom::Y] - 2 * p2[Geom::Y] + p1[Geom::Y]) * N11(it);
|
/inkscape/src/ui/dialog/ |
H A D | clonetiler.cpp | 2201 Geom::Point const p3 = r.corner(3) * m; member in class:Inkscape::UI::Dialog::Geom 2205 std::min(std::min(p1[X], p2[X]), std::min(p3[X], p4[X])), 2206 std::min(std::min(p1[Y], p2[Y]), std::min(p3[Y], p4[Y]))), 2208 std::max(std::max(p1[X], p2[X]), std::max(p3[X], p4[X])), 2209 std::max(std::max(p1[Y], p2[Y]), std::max(p3[Y], p4[Y]))));
|