Searched defs:pts (Results 1 - 20 of 20) sorted by relevance

/inkscape/src/helper/
H A Dgeom-curves.h32 std::vector<Geom::Point> pts = curve->controlPoints(); local
33 for (unsigned i = 1; i < pts.size() - 1; ++i) {
34 if (!are_near(pts[i], line))
/inkscape/src/live_effects/
H A Dlpe-interpolate_points.cpp69 std::vector<Geom::Point> pts; local
70 pts.push_back(path_it->initialPoint());
73 pts.push_back((*it).finalPoint());
76 Geom::Path path = interpolator->interpolateToPath(pts);
/inkscape/src/2geom/
H A Dconvex-hull.cpp95 ConvexHull::ConvexHull(std::vector<Point> const &pts) argument
98 //if (pts.size() > 16) { // arbitrary threshold
99 // _prune(pts.begin(), pts.end(), _boundary);
101 _boundary = pts;
280 void ConvexHull::swap(std::vector<Point> &pts) argument
282 _boundary.swap(pts);
H A Drect.cpp88 Point pts[4]; local
89 for (unsigned i=0; i<4; ++i) pts[i] = corner(i) * m;
90 Coord minx = std::min(std::min(pts[0][X], pts[1][X]), std::min(pts[2][X], pts[3][X]));
91 Coord miny = std::min(std::min(pts[0][Y], pts[1][Y]), std::min(pts[2][Y], pts[
[all...]
H A Dcurve.cpp168 std::vector<Point> pts; local
169 sbasis_to_bezier(pts, toSBasis(), 2); //TODO: use something better!
173 sink.curveTo(pts[0], pts[1], pts[2]);
H A Dbezier-curve.cpp110 BezierCurve::BezierCurve(std::vector<Point> const &pts) argument
111 : inner(pts)
113 if (pts.size() < 2) {
139 std::vector<Point> pts = controlPoints(); local
140 return bezier_length(pts[0], pts[1], pts[2], tolerance);
144 std::vector<Point> pts = controlPoints(); local
145 return bezier_length(pts[0], pts[
254 create(std::vector<Point> const &pts) argument
[all...]
H A Dconvex-hull.h66 ConvexHullLowerIterator(std::vector<Point> const &pts, std::size_t x) argument
67 : _data(&pts[0])
68 , _size(pts.size())
141 ConvexHull(std::vector<Point> const &pts);
275 void swap(std::vector<Point> &pts);
H A Dd2-sbasis.cpp342 std::vector<std::vector<Interval> > level_sets( D2<SBasis> const &f, std::vector<Point> pts, double tol){ argument
343 std::vector<Rect> regions( pts.size(), Rect() );
344 for (unsigned i=0; i<pts.size(); i++){
345 regions[i] = Rect( pts[i], pts[i] );
H A Dgeom.cpp240 eliminate_duplicates_p(std::vector<Point> &pts) argument
242 unsigned int size = pts.size();
248 if (pts[0] == pts[1]) {
249 pts.pop_back();
252 std::sort(pts.begin(), pts.end(), &is_less);
254 if (pts[0] == pts[1]) {
255 pts
[all...]
/inkscape/src/
H A Dsp-mesh.cpp191 std::vector< Geom::Point > pts = patch.getPointsForSide( k ); local
193 pts[1][X], pts[1][Y],
194 pts[2][X], pts[2][Y],
195 pts[3][X], pts[3][Y] );
H A Dsp-path.cpp97 std::list<std::pair<Geom::Point, Geom::Point> > pts; local
107 pts.push_back(std::make_pair(cit->initialPoint() * i2dt, cit->finalPoint() * i2dt));
112 sp_guide_pt_pairs_to_guides(this->document, pts);
H A Dsp-guide.cpp237 void sp_guide_pt_pairs_to_guides(SPDocument *doc, std::list<std::pair<Geom::Point, Geom::Point> > &pts) argument
239 for (std::list<std::pair<Geom::Point, Geom::Point> >::iterator i = pts.begin(); i != pts.end(); ++i) {
247 std::list<std::pair<Geom::Point, Geom::Point> > pts; local
254 pts.push_back(std::pair<Geom::Point, Geom::Point>(A, B));
255 pts.push_back(std::pair<Geom::Point, Geom::Point>(B, C));
256 pts.push_back(std::pair<Geom::Point, Geom::Point>(C, D));
257 pts.push_back(std::pair<Geom::Point, Geom::Point>(D, A));
259 sp_guide_pt_pairs_to_guides(doc, pts);
H A Dsp-rect.cpp518 std::list<std::pair<Geom::Point, Geom::Point> > pts; local
527 pts.push_back(std::make_pair(A1, A2));
528 pts.push_back(std::make_pair(A2, A3));
529 pts.push_back(std::make_pair(A3, A4));
530 pts.push_back(std::make_pair(A4, A1));
532 sp_guide_pt_pairs_to_guides(this->document, pts);
H A Dbox3d.cpp1318 box3d_push_back_corner_pair(SPBox3D const *box, std::list<std::pair<Geom::Point, Geom::Point> > &pts, int c1, int c2) { argument
1319 pts.push_back(std::make_pair(box3d_get_corner_screen(box, c1, false),
1331 std::list<std::pair<Geom::Point, Geom::Point> > pts; local
1334 box3d_push_back_corner_pair(this, pts, 0, 1);
1335 box3d_push_back_corner_pair(this, pts, 2, 3);
1336 box3d_push_back_corner_pair(this, pts, 4, 5);
1337 box3d_push_back_corner_pair(this, pts, 6, 7);
1340 box3d_push_back_corner_pair(this, pts, 0, 2);
1341 box3d_push_back_corner_pair(this, pts, 1, 3);
1342 box3d_push_back_corner_pair(this, pts,
[all...]
H A Dsp-item.cpp1705 std::list<std::pair<Geom::Point, Geom::Point> > pts; local
1712 pts.push_back(std::make_pair(A, B));
1713 pts.push_back(std::make_pair(B, C));
1714 pts.push_back(std::make_pair(C, D));
1715 pts.push_back(std::make_pair(D, A));
1717 sp_guide_pt_pairs_to_guides(document, pts);
/inkscape/src/livarot/
H A DPath.h93 std::vector<path_lineto> pts; member in class:Path
/inkscape/share/extensions/
H A Dvoronoi.py775 pts = [] variable
783 pts.append(Site(x,y))
786 if doHelp or len(pts) == 0:
790 sl = SiteList(pts)
/inkscape/src/ui/tool/
H A Dcontrol-point-selection.cpp719 void ControlPointSelection::getOriginalPoints(std::vector<Inkscape::SnapCandidatePoint> &pts) argument
721 pts.clear();
723 pts.push_back(Inkscape::SnapCandidatePoint(_original_positions[*i], SNAPSOURCE_NODE_HANDLE));
727 void ControlPointSelection::getUnselectedPoints(std::vector<Inkscape::SnapCandidatePoint> &pts) argument
729 pts.clear();
734 pts.push_back(n->snapCandidatePoint());
/inkscape/src/libuemf/
H A Duemf.c1681 \param pts the polyline
1687 PU_POINT pts,
1693 for(i=0; i<count;i++,pts++){
1694 if ( pts->x < rect.left ) rect.left = pts->x;
1695 if ( pts->x > rect.right ) rect.right = pts->x;
1696 if ( pts->y < rect.top ) rect.top = pts->y;
1697 if ( pts
1685 findbounds( uint32_t count, PU_POINT pts, uint32_t width ) argument
1715 findbounds16( uint32_t count, PU_POINT16 pts, uint32_t width ) argument
[all...]
H A Dupmf.c6560 U_PMF_POINTF *pts = (U_PMF_POINTF *)malloc(Elements * sizeof(U_PMF_POINTF)); local
6561 if(!pts){ return(status); }
6562 *Points = pts;
6567 for(XFS = YFS = 0.0; Elements; Elements--, pts++){
6571 pts->X = XFS;
6572 pts->Y = YFS;
6576 for(XF = YF = 0.0; Elements; Elements--, pts++){
6578 pts->X = XF;
6579 pts->Y = YF;
6583 for(XF = YF = 0.0; Elements; Elements--, pts
[all...]

Completed in 97 milliseconds