I have a 2d array of kink angles and need to interpolate a best-fit surface. I do not need the curves to go through any given point in 3 space (and in fact, cannot specify any of these points), except perhaps an origin point.
For example, if all of the U angles are zero and V angles are 180/degree, the resulting surface should be a cylinder that curves along V and is flat along U.
As an example, let’s say I have an 8x8 grid of kink angles (doubles ranged -1 to 1) and want to return a single network surface made up of 8 curves in U and 8 curves in V that meet at 64 points.
Ultimately, I’ll be writing it as a C# implementation, but would happily settle for a strategy to do it with components.
Once I have it, I’ll be evaluating guassian curvature at each u,v intersection and jittering the kink angles toward a minimal guassian curvature surface using gradient descent (I should have that part under control, I think…).