By "mock-parametric" interpolating curves I understand a class of curves that connect a discrete sequence of points with a predefined degree of smoothness and, that correspond to a non-parametric function in a local coordinate system defined by $p\_i$ as the origin and, $\frac{p\_{i+1}-p\_i}{\|p\_{i+1}-p\_i\|}$ as the local x-axis between $p\_i$ and $p\_{i+1}$


The reason, why I am interested in that kind of splines is that they seem to combine the simple control of ordinary spline interpolation with some of the flexibility of parametric splines; also the formulation of some optimization goals seems to be easier to formulate: least deviation from the polyline translates to minimizing the Chebyshev norm across all local function-definitions and, because the curvature of functions can be approximated by the 2nd derivative, it seems to be easier to find interpolating curves that come close to optimality w.r.t. conditions on curvature.


  


> 
> **Question:**
> 
> 
> has that kind of mock-parametric spline interpolation already been investigated? I am especially interested in the formulation and algorithmic ensuring of the smoothness conditions, as well as in results about the quality of the resulting curves, when compared to parametric spline-interpolation.
> 
> 
> 



Smoothness Conditions for Planar "Mock-parametric" Spline Interpolation
The "Wilson-Fowler" spline has the properties that you describe. Each segment is defined by a cubic polynomial in a rotated coordinate system. These splines were quite common in the days before parametric vector-valued ones became the standard. For example, they were used in most versions of [the APT system](https://en.wikipedia.org/wiki/APT_(programming_language)) for driving numerically controlled machine tools.


