Searched refs:pts (Results 1 - 25 of 39) sorted by relevance

12

/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/2geom/
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 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...]
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 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 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);
/inkscape/share/extensions/
H A Dextrude.py46 pts = [cubicsuperpath.parsePath(paths[i].get('d'))
53 simpletransform.applyTransformToPath(trans, pts[i])
58 for i in range(0, min(map(len, pts))):
60 for j in range(0, min(len(pts[n1][i]), len(pts[n2][i]))):
61 comp.append([pts[n1][i][j][1][-2:], pts[n2][i][j][1][-2:]])
H A Dpolyhedron_3d.py156 def draw_SVG_poly(pts, face, st, name, parent):
164 d = d+ str(pts[face[i]-1][0]) + ',' + str(-pts[face[i]-1][1])#add point
171 def draw_edges( edge_list, pts, st, parent ):
173 pt_1 = pts[ edge[0]-1 ][0:2] #the point at the start
174 pt_2 = pts[ edge[1]-1 ][0:2] #the point at the end
178 def draw_faces( faces_data, pts, obj, shading, fill_col,st, parent):
186 draw_SVG_poly(pts, obj.fce[ face_no ], st, 'Face:'+str(face_no), parent)
213 def get_normal( pts, face): #returns the normal vector for the plane passing though the first three elements of face of pts
[all...]
H A Dgenerate_voronoi.py115 pts = []
121 pts.append(voronoi.Site(x, y))
123 pts.append(voronoi.Site(x + q['width'], y))
125 pts.append(voronoi.Site(x + q['width'], y + q['height']))
127 pts.append(voronoi.Site(x + q['width'], y - q['height']))
129 pts.append(voronoi.Site(x - q['width'], y))
131 pts.append(voronoi.Site(x - q['width'], y + q['height']))
133 pts.append(voronoi.Site(x - q['width'], y - q['height']))
135 pts.append(voronoi.Site(x, y + q['height']))
137 pts
[all...]
H A Ddraw_from_triangle.py311 pts = [] #initialise in case nothing is selected and following loop is not executed
314 pts = get_n_points_from_path( node, 3 ) #find the (x,y) coordinates of the first 3 points of the path
317 if len(pts) == 3: #if we have right number of nodes, else skip and end program
322 group_translation = 'translate(' + str( pts[0][0] ) + ','+ str( pts[0][1] ) + ')'
330 [pts[1][0]-pts[0][0],pts[1][1]-pts[0][1]],
331 [pts[
[all...]
H A Dcubicsuperpath.py94 for pts in p:
95 applymat(mat, pts[0])
96 applymat(mat, pts[1])
97 applymat(mat, pts[2])
H A Dvoronoi2svg.py243 pts = []
259 pts.append(Point(pt[0],pt[1]))
317 pts.append(Point(safeBox[0],safeBox[2]))
318 pts.append(Point(safeBox[1],safeBox[2]))
319 pts.append(Point(safeBox[1],safeBox[3]))
320 pts.append(Point(safeBox[0],safeBox[3]))
336 vertices,lines,edges = voronoi.computeVoronoiDiagram(pts)
/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/livarot/
H A DPathConversion.cpp76 nextX = pts[lastMoveTo].p;
78 if (n > 0) pts[n].closed = true;
242 nextX = pts[lastMoveTo].p;
252 pts[descr_cmd[curP]->associated].closed = true;
457 nextX = pts[lastMoveTo].p;
481 pts[descr_cmd[curP]->associated].closed = true;
1279 dest->Reset(pts.size(), pts.size());
1282 if ( pts.size() <= 1 ) {
1296 for (int i = 0; i < int(pts
[all...]
H A DPath.cpp410 pts.clear();
420 if ( !mvto && pts.empty() == false && pts.back().p == iPt ) {
424 int const n = pts.size();
425 pts.push_back(path_lineto(mvto ? polyline_moveto : polyline_lineto, iPt));
432 if (pts.empty()) {
436 int const n = pts.size() - 1;
437 pts[n] = path_lineto(polyline_lineto, iPt);
448 if ( !mvto && pts.empty() == false && pts
[all...]
H A DPathCutting.cpp37 std::vector<path_lineto> orig_pts = pts;
38 pts.clear();
472 * \return Length of the lines in the pts vector.
477 if ( pts.empty() ) {
481 Geom::Point lastP = pts[0].p;
484 for (std::vector<path_lineto>::const_iterator i = pts.begin(); i != pts.end(); ++i) {
499 if ( pts.empty() ) {
503 Geom::Point lastM = pts[0].p;
507 for (std::vector<path_lineto>::const_iterator i = pts
[all...]
H A DPathStroke.cpp49 dest->Reset(3 * pts.size(), 3 * pts.size());
55 while (lastM < int(pts.size())) {
58 while (lastP < int(pts.size()) // select one subpath
59 && (pts[lastP].isMoveTo == polyline_lineto
60 || pts[lastP].isMoveTo == polyline_forced))
66 Geom::Point sbStart = pts[lastM].p;
67 Geom::Point sbEnd = pts[lastP - 1].p;
68 // if ( pts[lastP - 1].closed ) { // this is correct, but this bugs text rendering (doesn't close text stroke)...
82 Geom::Point pos = pts[last
[all...]
H A DPathSimplify.cpp47 if (pts.size() <= 1) {
54 while (lastM < int(pts.size())) {
56 while (lastP < int(pts.size())
57 && (pts[lastP].isMoveTo == polyline_lineto
58 || pts[lastP].isMoveTo == polyline_forced))
167 Geom::Point const moveToPt = pts[off].p;
188 if (pts[off + lastP].isMoveTo == polyline_forced) {
217 endToPt = pts[off + lastP].p;
335 data.Xk[i] = pts[off + i].p[Geom::X];
336 data.Yk[i] = pts[of
[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-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-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-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 Dsp-guide.h94 void sp_guide_pt_pairs_to_guides(SPDocument *doc, std::list<std::pair<Geom::Point, Geom::Point> > &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...]
/inkscape/src/ui/tool/
H A Dcontrol-point-selection.h118 void getOriginalPoints(std::vector<Inkscape::SnapCandidatePoint> &pts);
119 void getUnselectedPoints(std::vector<Inkscape::SnapCandidatePoint> &pts);

Completed in 69 milliseconds

12