Searched refs:points (Results 1 - 25 of 63) sorted by relevance

123

/inkscape/src/live_effects/
H A Dlpe-powerstroke-interpolators.h2 * Interpolators for lists of points.
42 virtual Geom::Path interpolateToPath(std::vector<Point> const &points) const = 0;
54 virtual Path interpolateToPath(std::vector<Point> const &points) const {
56 path.start( points.at(0) );
57 for (unsigned int i = 1 ; i < points.size(); ++i) {
58 path.appendNew<Geom::LineSegment>(points.at(i));
74 virtual Path interpolateToPath(std::vector<Point> const &points) const {
75 unsigned int n_points = points.size();
81 points_array[i] = points.at(i);
115 virtual Path interpolateToPath(std::vector<Point> const &points) cons
[all...]
/inkscape/src/
H A Dsp-line.cpp117 Geom::Point points[2]; local
120 points[0] = Geom::Point(this->x1.computed, this->y1.computed)*i2dt;
121 points[1] = Geom::Point(this->x2.computed, this->y2.computed)*i2dt;
123 SPGuide::createSPGuide(this->document, points[0], points[1]);
128 Geom::Point points[2]; local
130 points[0] = Geom::Point(this->x1.computed, this->y1.computed);
131 points[1] = Geom::Point(this->x2.computed, this->y2.computed);
133 points[0] *= transform;
134 points[
[all...]
H A Dguide-snapper.cpp78 isr.points.push_back(dummy);
84 isr.points.push_back(dummy);
90 isr.points.push_back(dummy);
H A Dobject-snapper.h61 //store some lists of candidates, points and paths, so we don't have to rebuild them for each point we want to snap
70 * @param bbox_to_snap Bounding box hulling the whole bunch of points, all from the same selection and having the same transformation.
122 void _getBorderNodes(std::vector<SnapCandidatePoint> *points) const;
127 void getBBoxPoints(Geom::OptRect const bbox, std::vector<SnapCandidatePoint> *points, bool const isTarget, bool const includeCorners, bool const includeLineMidpoints, bool const includeObjectMidpoints);
H A Dpure-transform.cpp19 void PureTransform::snap(::SnapManager *sm, std::vector<Inkscape::SnapCandidatePoint> const &points, Geom::Point const &pointer) { argument
24 for (std::vector<Inkscape::SnapCandidatePoint>::const_iterator i = points.begin(); i != points.end(); ++i) {
29 // add the current transformed point to the box hulling all transformed points
30 if (i == points.begin()) {
53 for (std::vector<Inkscape::SnapCandidatePoint>::const_iterator i = points.begin(); i != points.end(); ++i) {
84 // ... and none of the points before snapped either
88 if (best_snapped_point.isOtherSnapBetter(snapped_point, true) || points.size() == 1) {
143 // When doing a constrained translation, all points wil
[all...]
H A Dobject-snapper.cpp168 // Now, let's first collect all points to snap to. If we have a whole bunch of points to snap,
316 isr.points.push_back(s);
344 isr.points.push_back(s);
355 // Now, let's first collect all paths to snap to. If we have a whole bunch of points to snap,
523 //std::cout << "#nearest points = " << anp.size() << " | p = " << p.getPoint() << std::endl;
524 // Now we will examine each of the nearest points, and determine whether it's within snapping range and if we should snap to it
618 // The intersection point of the constraint line with any path, must lie within two points on the
619 // SnapConstraint: p_min_on_cl and p_max_on_cl. The distance between those points is twice the snapping tolerance
649 // Convert the collected intersections to snapped points
778 getBBoxPoints(Geom::OptRect const bbox, std::vector<SnapCandidatePoint> *points, bool const , bool const includeCorners, bool const includeLineMidpoints, bool const includeObjectMidpoints) argument
[all...]
/inkscape/src/libdepixelize/priv/
H A Doptimization-kopf2011.h50 * Return true if the four points are considered a border.
53 bool is_border(const Point<T> (&points)[4])
58 if ( points[1].y == points[2].y ) {
59 dy[0] = points[1].y - points[0].y;
60 dy[1] = points[3].y - points[2].y;
62 dx[0] = points[1].x - points[
[all...]
/inkscape/share/extensions/
H A Drender_gear_rack.py73 # generate points: list of (x, y) pairs
74 points = []
79 points.append((x, 0))
80 points.append((x + tas, spacing))
81 points.append((x + spacing, spacing))
82 points.append((x + spacing + tas, 0))
85 path = points_to_svgd(points)
H A Ddm2svg.py73 points = ' '.join(','.join(map(str, e)) for e in coords)
74 svg_element = '<polyline points="%s" dm:timestamp="%s" />' % (points, timestamp)
H A Dprint_win32_vector.py112 points = POINTS()
114 points[6*i] = int(sub[i][2][0])
115 points[6*i + 1] = int(sub[i][2][1])
116 points[6*i + 2] = int(sub[i + 1][0][0])
117 points[6*i + 3] = int(sub[i + 1][0][1])
118 points[6*i + 4] = int(sub[i + 1][1][0])
119 points[6*i + 5] = int(sub[i + 1][1][1])
120 mygdi.PolyBezierTo(self.hDC, addressof(points), 3*(len(sub)-1))
H A Dperfectboundcover.py27 def points_to_ppi(points):
28 return caliper_to_ppi(points / 1000.0)
90 "points": lambda x: points_to_ppi(x),
H A Drender_gears.py122 points = []
156 points.extend( p_tmp )
158 path = points_to_svgd( points )
/inkscape/src/2geom/
H A Dconic_section_clipper_impl.h135 std::list<Point>::iterator split (std::list<Point> & points,
138 void rsplit (std::list<Point> & points,
143 void rsplit (std::list<Point> & points,
200 * the intersection point of the tangent lines at points P and Q.
232 // we find two intersection points only the nearest belongs to the given arc
234 // end points are on the same branch, because they are paired) the tangent
251 * Given a list of points on the conic section, and given two consecutive
252 * points belonging to the list and passed by two list iterators, the method
254 * points as initial and final point. This new point is inserted into the list
255 * between the two passed points an
259 split(std::list<Point> & points, std::list<Point>::iterator sp, std::list<Point>::iterator fp) const argument
281 rsplit(std::list<Point> & points, std::list<Point>::iterator sp, std::list<Point>::iterator fp, size_t k) const argument
310 rsplit(std::list<Point> & points, std::list<Point>::iterator sp, std::list<Point>::iterator fp, double length) const argument
[all...]
H A Dconic_section_clipper_impl.cpp40 * Find rectangle-conic crossing points. They are returned in the
180 // Order crossing points on the rectangle edge clockwise, so two consecutive
181 // crossing points would be the end points of a conic arc all inside or all
211 * Test if two crossing points are the end points of a conic arc inner to the
214 * with the given end-points.
222 * we looks for the points on the conic whose tangent is parallel to the
236 * such points are found intersecating the conic section with the line
276 // we order the crossing points clockwis
492 std::list<Point> points; local
[all...]
H A Dcircle.cpp217 // with two points in the centers and with edge lengths equal to radii
234 // The triangle given by the points:
241 // now compute the intersection points
282 void Circle::fit(std::vector<Point> const& points)
284 size_t sz = points.size();
286 THROW_RANGEERROR("fitting error: too few points passed");
289 _center = points[0] * 0.5 + points[1] * 0.5;
290 _radius = distance(points[0], points[
[all...]
H A Dconicsec.h143 * N points.
145 * points: points to fit
147 * precondition: there must be at least 5 non-overlapping points
149 xAx (std::vector<Point> const& points) argument
151 set (points);
227 void set (std::vector<Point> const& points);
448 * by the passed points.
455 * prerequisite: the passed points must lie on the conic, the inner point
457 * initial and final points ar
480 std::vector<Point> points = allNearestTimes (P); local
[all...]
/inkscape/src/helper/
H A Dgeom-pathstroke.cpp60 // Area of triangle given three corner points
68 // Alternative touching circle routine directly using Beziers. Works only at end points.
178 // miter needs clipping, find two points
214 Geom::Point pick_solution(std::vector<Geom::ShapeIntersection> points, Geom::Point tang2, Geom::Point endPt) argument
216 assert(points.size() == 2);
218 if ( dot(tang2, points[0].point() - endPt) > 0 ) {
219 // points[0] is bad, choose points[1]
220 sol = points[1];
221 } else if ( dot(tang2, points[
343 std::vector<Geom::ShapeIntersection> points = circle1.intersect( bisector ); local
405 std::vector<Geom::ShapeIntersection> points; local
827 std::vector<Geom::Point> points = bez.controlPoints(); local
[all...]
/inkscape/src/display/
H A Dcairo-utils.cpp532 std::vector<Geom::Point> points = quadratic_bezier->controlPoints(); local
533 points[0] *= trans;
534 points[1] *= trans;
535 points[2] *= trans;
537 Geom::Point b1 = points[0] + (2./3) * (points[1] - points[0]);
538 Geom::Point b2 = b1 + (1./3) * (points[2] - points[0]);
540 cairo_curve_to(cr, b1[X], b1[Y], b2[X], b2[Y], points[
555 std::vector<Geom::Point> points = cubic_bezier->controlPoints(); local
[all...]
/inkscape/src/extension/internal/
H A Dlatex-pstricks.cpp302 std::vector<Geom::Point> points = cubic_bezier->controlPoints(); local
303 os << "\\curveto(" << points[1][X] << "," << points[1][Y] << ")("
304 << points[2][X] << "," << points[2][Y] << ")("
305 << points[3][X] << "," << points[3][Y] << ")\n"; local
H A Dpov-out.cpp351 out(" %d //nr points\n", segmentCount * 4);
390 std::vector<Geom::Point> points = cubic->controlPoints(); local
391 Geom::Point p0 = points[0];
392 Geom::Point p1 = points[1];
393 Geom::Point p2 = points[2];
394 Geom::Point p3 = points[3];
/inkscape/src/trace/
H A Dsiox.cpp1134 void Siox::colorSignatureStage1(CieLab *points,
1143 CieLab point = points[leftBase];
1149 point = points[i];
1162 //# partition points according to the dimension
1167 point = points[left];
1174 point = points[right];
1183 point = points[left];
1184 points[left] = points[right];
1185 points[righ
[all...]
/inkscape/src/trace/potrace/
H A Dinkscape-potrace.cpp114 * Check a point against a list of points to see if it
117 static bool hasPoint(std::vector<Point> &points, double x, double y) argument
119 for (unsigned int i=0; i<points.size() ; i++)
121 Point p = points[i];
135 Inkscape::SVG::PathString& data, std::vector<Point> &points)
154 if (hasPoint(points, x2, y2))
163 points.push_back(p);
196 nodeCount += writePaths(engine, child, data, points);
398 std::vector<Point> points; local
399 long thisNodeCount = writePaths(this, potraceState->plist, data, points);
134 writePaths(PotraceTracingEngine *engine, potrace_path_t *plist, Inkscape::SVG::PathString& data, std::vector<Point> &points) argument
[all...]
/inkscape/src/libavoid/
H A Dgraph.h65 std::pair<Point, Point> points(void);
/inkscape/src/libuemf/
H A Duemf.c483 \brief Derive from bounding rect, start and end radials, for arc, chord, or pie, the center, start, and end points, and the bounding rectangle.
582 \brief Derive from an EMF arc, chord, or pie the center, start, and end points, and the bounding rectangle.
1597 \brief Set rect and rectl objects from Upper Left and Lower Right corner points.
1614 \brief Set rect and rectl objects from Upper Left and Lower Right corner points.
1680 \param count number of points in the polyline
1710 \param count number of points in the polyline
1795 1 Conformal map of points based on scale, axis rotation, and axis ratio,
2751 \param points pointer to the source U_POINT structures
2752 \param count number of members in points
2757 PU_POINT points_transform(PU_POINT points, in argument
2780 point16_transform(PU_POINT16 points, int count, U_XFORM xform) argument
2825 point16_to_point(PU_POINT16 points, int count) argument
2844 point_to_point16(PU_POINT points, int count) argument
2884 U_EMR_CORE1_set(uint32_t iType, U_RECTL rclBounds, const uint32_t cptl, const U_POINTL *points) argument
2903 U_EMR_CORE2_set(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cptl, const U_POINTL *points) argument
2970 U_EMR_CORE6_set(uint32_t iType, U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points) argument
3076 U_EMR_CORE10_set(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points) argument
[all...]
/inkscape/src/ui/dialog/
H A Dspellcheck.cpp591 std::vector<Geom::Point> points = local
593 if (points.size() >= 4) { // we may not have a single quad if this is a clipped part of text on path; in that case skip drawing the rect
595 tl = br = points.front();
596 for (unsigned i = 0 ; i < points.size() ; i ++) {
597 if (points[i][Geom::X] < tl[Geom::X])
598 tl[Geom::X] = points[i][Geom::X];
599 if (points[i][Geom::Y] < tl[Geom::Y])
600 tl[Geom::Y] = points[i][Geom::Y];
601 if (points[i][Geom::X] > br[Geom::X])
602 br[Geom::X] = points[
[all...]

Completed in 2063 milliseconds

123