Searched defs:points (Results 1 - 25 of 32) sorted by relevance

12

/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 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 Dsnapper.h25 std::list<Inkscape::SnappedPoint> points; member in struct:IntermSnapResults
36 /// Parent for classes that can snap points to something
H A Dsnap.cpp282 * \param bbox_to_snap Bounding box hulling the set of points, all from the same selection and having the same transformation
446 std::vector<Inkscape::SnapCandidatePoint> const &points,
451 /* We have a list of points, which we are proposing to transform in some way. We need to see
452 ** if any of these points, when transformed, snap to anything. If they do, we return the
456 if (points.size() == 0) {
461 // We will try to snap a set of points, but we don't want to have a snap indicator displayed
467 transform.snap(this, points, pointer);
480 if (points.size() == 1) {
481 displaySnapsource(Inkscape::SnapCandidatePoint(transform.best_snapped_point.getPoint(), points.at(0).getSourceType()));
495 std::cout << " Points : " << isr.points
445 snapTransformed( std::vector<Inkscape::SnapCandidatePoint> const &points, Geom::Point const &pointer, Inkscape::PureTransform &transform ) argument
[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...]
H A Ddocument.cpp1339 The list can be persisted, which improves "find at multiple points" speed.
1458 std::vector<SPItem*> SPDocument::getItemsAtPoints(unsigned const key, std::vector<Geom::Point> points, bool all_layers, size_t limit) const argument
1482 for(int i = points.size()-1;i>=0; i--) {
1483 SPItem *item = find_item_at_point(&_node_cache, key, points[i]);
/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 Dbezier-curve.cpp46 * Bezier curves are an expansion of the concept of linear interpolation to n points.
50 * of order \f$n\f$ defined by the points \f$\mathbf{p}_0, \mathbf{p}_1, \ldots, \mathbf{p}_n\f$.
51 * Bezier curve of order 1 is a linear interpolation curve between two points, defined as
53 * If we now substitute points \f$\mathbf{p_0}\f$ and \f$\mathbf{p_1}\f$ in this definition
60 * By substituting points for quadratic Bezier curves in the original definition,
73 * the evaluation of a point on the curve as follows: first, all control points are joined with
75 * Then, the marked points are joined with straight lines and the point corresponding to
81 * An important property of the Bezier curves is that their parameters (control points)
86 * of its control points). This fact is useful for sweepline algorithms and intersection.
114 THROW_RANGEERROR("Bezier curve must have at least 2 control points");
443 bezier_length(std::vector<Point> const &points, Coord tolerance) 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 Dbezier-curve.h57 /// @name Access and modify control points
60 * A Bezier curve has order() + 1 control points. */
62 /** @brief Get the number of control points. */
64 /** @brief Access control points of the curve.
66 * @return The control point. No-reference return, use setPoint() to modify control points. */
69 /** @brief Get the control points.
70 * @return Vector with order() + 1 control points. */
81 /** @brief Set new control points.
82 * @param ps Vector which must contain order() + 1 points.
88 THROW_LOGICALERROR("BezierCurve::setPoints: incorrect number of points i
200 BezierCurveN(std::vector<Point> const &points) argument
[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...]
H A Dellipse.cpp197 void Ellipse::fit(std::vector<Point> const &points) argument
199 size_t sz = points.size();
201 THROW_RANGEERROR("fitting error: too few points passed");
207 fitter.append(points[i]);
250 // is positive for points on the left side of a vector and negative
513 // Out of three possible pairs of lines that go through four points of intersection
614 // the four extreme points at the end of each ray for each ellipse
632 // Do the actual comparison by computing four points on each ellipse.
H A Dconicsec.cpp318 * At this point we have tried up to 4 points: 0,0, 1,0, 1,1, 2,1, 1.5,1.5
320 * No degenerate conic can pass through these points, so we can assume
700 * N points.
702 * points: points to fit
704 * precondition: there must be at least 5 non-overlapping points
706 void xAx::set(std::vector<Point> const& points) argument
708 size_t sz = points.size();
711 THROW_RANGEERROR("fitting error: too few points passed");
718 fitter.append(points[
1429 std::vector<Point> points; 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 Djavafx-out.cpp545 std::vector<Geom::Point> points = cubic->controlPoints(); local
546 Geom::Point p1 = points[1];
547 Geom::Point p2 = points[2];
548 Geom::Point p3 = points[3];
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];
H A Dwmf-print.cpp986 std::vector<Geom::Point> points = cubic->controlPoints(); local
987 //Geom::Point p0 = points[0];
988 Geom::Point p1 = points[1];
989 Geom::Point p2 = points[2];
990 Geom::Point p3 = points[3];
1197 totPoints += 1 + pit->size_default(); // big array, will hold all points, for all polygons. Size_default ignores first point in each path.
1223 *n16ptr++ = pit->size_default(); // points in the subpath
1258 /* Figure out how many points there are, make an array big enough to hold them, and store
1259 all the points. This is the same for open or closed path. This gives the upper bound for
1260 the number of points
[all...]
/inkscape/src/libavoid/
H A Dgraph.cpp85 // We should only be calling this with orthogonal points,
330 pair<Point, Point> EdgeInf::points(void) function in class:Avoid::EdgeInf
/inkscape/src/libdepixelize/priv/
H A Dhomogeneoussplines.h153 SelfCommonEdge _common_edge(Points &points, points_riter it);
243 // it can infinite loop if points of both entities are equal,
249 // It's an edge, then the points are closer together. After we find the
250 // first point, there is no need for check against all points of the src
341 HomogeneousSplines<T>::_common_edge(Points &points, points_riter it) argument
345 ret.grt_end = points.rend();
398 // second, we copy src points to polygon
/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/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...]
/inkscape/src/ui/tools/
H A Dmesh-tool.cpp330 std::map<SPMesh*, std::vector<guint> > points; local
347 // Collect points together for same gradient
348 points[gradient].push_back( d->point_i );
354 for( std::map<SPMesh*, std::vector<guint> >::const_iterator iter = points.begin(); iter != points.end(); ++iter) {
868 case GDK_KEY_g: // Toggle mesh tensor points on/off
H A Dfreehand-base.cpp231 static void spdc_apply_powerstroke_shape(const std::vector<Geom::Point> & points, FreehandBase *dc, SPItem *item) argument
237 static_cast<LPEPowerStroke*>(lpe)->offset_points.param_set_and_write_new_value(points);
261 s << points[0][Geom::X] << "," << stroke_width / 2.;
365 std::vector<Geom::Point> points(1);
366 points[0] = Geom::Point(0., SHAPE_HEIGHT/2);
367 spdc_apply_powerstroke_shape(points, dc, item);
376 std::vector<Geom::Point> points(1);
377 points[0] = Geom::Point((double)curve_length, SHAPE_HEIGHT/2);
378 spdc_apply_powerstroke_shape(points, dc, item);
/inkscape/src/live_effects/
H A Dlpe-powerstroke.cpp177 offset_points(_("Offset points"), _("Offset points"), "offset_points", &wr, this),
178 sort_points(_("Sort points"), _("Sort offset points according to their time value along the curve"), "sort_points", &wr, this, true),
214 std::vector<Geom::Point> points; local
248 points.push_back( Geom::Point(0.2,width) );
249 points.push_back( Geom::Point(0.5,width) );
250 points.push_back( Geom::Point(0.8,width) );
255 points.push_back( Geom::Point(0.2,width) );
257 points
[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...]

Completed in 75 milliseconds

12