Lines Matching refs:points
2 * 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) const {
117 fit.start(points.at(0));
118 for (unsigned int i = 1; i < points.size(); ++i) {
119 Point p0 = points.at(i-1);
120 Point p1 = points.at(i);
146 virtual Path interpolateToPath(std::vector<Point> const &points) const {
148 fit.start(points.at(0));
149 unsigned int num_points = points.size();
151 Point p0 = points.at(i-1);
152 Point p1 = points.at(i);
156 } else if (i == points.size() - 1) {
181 virtual Path interpolateToPath(std::vector<Point> const &points) const {
186 guint len = points.size();
189 controlpoints[i].x = points[i][X];
190 controlpoints[i].y = points[i][Y] / scale_y;
215 virtual Path interpolateToPath(std::vector<Point> const &points) const {
216 unsigned int n_points = points.size();
218 Geom::Path fit(points.front());
220 if (n_points < 3) return fit; // TODO special cases for 0,1 and 2 input points
225 fit.append(calc_bezier(points[0],points[0],points[1],points[2]));
228 Point p0 = points[i];
229 Point p1 = points[i+1];
230 Point p2 = points[i+2];
231 Point p3 = (i < n_points-3) ? points[i+3] : points[i+2];
246 // calculate time coords (deltas) of points
255 // safety check for repeated points