Question

So I’ve got a special case set of cubic splines, whose 2d control points will always result in a curve that will never cross itself in the x axis. That is, the curves look like they could be a simple polynomial function such that y=f(x). I want to efficiently create an array of y coordinates along the spline that correspond to evenly-spaced x coordinates running the length of the spline segment.

I want to efficiently find the y coordinates along the spline where, for instance, x=0.0, x=0.1, x=0.2, etc., or approached another way, effectively transform the f_x,y(t) style function into an f(x) function.

I’m currently using a 4×4 constant matrix and four 2d control points to describe the spline, using matrix constants for either Hermite or Catmull-Rom splines, and plugging them into a cubic function of t going from 0 to 1.

Given the matrix and the control points, what’s the best way to obtain these y values over the x axis?

EDIT: I should add that an approximation good enough to draw is sufficient.

Answer 1

Your question states that you want evenly spaces x coordinates, and approximate solutions are all right. So I propose the following algorithm:

• Decide on the grid points you want, e.g. one every 0.1 x units.
• Start with l = 0 and r = 1.
• Compute f_x(l) and f_x(r) and consider the interval denoted by these endpoints.
  • If the interval is sufficiently small and contains exactly one grid point, use the central parameter t=(l+r)/2 as a good approximation for this grid point, and return that as a one-element list.
  • If there is at least one grid point in that interval, split it in two using (l+r)/2 as the splitting point, and concatenate the resulting lists from both computations.
  • If there is no grid point in the interval, then skip the current branch of the computation, returning an empty list.

This will zoom in on the grid points, bisecting the parameter space in each step, and will come up with suitable parameters for all your grid points.