# How can I express Logarithmic and Arithmetic spirals as segmented cubic bezier curves?

I am creating cubic bezier curves using this code from another question I asked. I would like to know how I can express Logarithmic and Arithmetic spirals as segmented cubic bezier curves.

• There's nothing particularly special about logarithmic or arithmetic spirals that require doing something radically different when approximating them as Bézier splines. The steps are exactly the same: 1) choose how far along the curve you want to begin/end your segment (this is a judgement call you make, trading off between simple/sparse and dense/accurate) 2) sample the source curve at those inputs to get the start & end anchor points for this segment 3) sample the source curve's derivative at those inputs to get the start & end control points. Where in this process do you need help? – DMGregory Nov 5 '18 at 20:19
• @DMGregory 1) From my understanding, this is based on an initial single cubic segment, from 2) and 3) I don’t quite understand what you mean by sampling the source curve. Which inputs are you referring to? – hutfelt Nov 5 '18 at 20:56
• You can think of either curve as a parametric functions eg. Vector3 ArchimedeanSpiral(Vector3 center, float a, float b, float theta) { return center + (b * theta) * Quaternion.Euler(0, 0, theta + a) * Vector3.right; } - sampling the curve means evaluating this parametric function for your chosen curve (center, a, b) and position on that curve (theta). I don't understand what you mean by an initial cubic segment for part 1) - how are you choosing that first segment at the moment? – DMGregory Nov 5 '18 at 21:03
• @DMGregory I thought "choose how far along the curve you want to begin/end your segment" meant you needed an initial cubic curve that would form the basis for the trade offs for the whole spiral. Not sure how it would be chosen or how the trade offs will be determined though – hutfelt Nov 5 '18 at 21:14
• That's a judgement call on your part. You could make one cubic segment for each quarter-turn of the spiral, for instance. Or you could divide each turn of the spiral into 50 segments. Or you could use some kind of adaptive spacing, with fewer segments on some parts of the curve and more segments on other parts. This is something usually better-handled in a problem-solving context though, eg. "I tried spacing my segments like this... but then the result is too dense / too inaccurate in these cases... how can I improve my choice of spacing?" – DMGregory Nov 5 '18 at 21:32

Here I'll use a utility function to produce points on an Archimedean spiral at a particular angle, along with the derivative of the function at that point. To reduce the number of parameters, I'll use the Transform of our object to apply translation/scaling/rotation of the curve. You can also use a matrix or add these parameters as additional arguments.

Vector3 ArchimedeanSpiral(float spacing, float angle, out Vector3 derivative) {
Vector3 perpendicular = new Vector3(-direction.y, direction.x, 0);

float b = spacing/360f;

derivative = transform.TransformVector(b * (direction + radians * perpendicular));
return transform.TransformPoint(b * angle * direction);
}


Now we can choose points on a Bezier spline approximating this spiral like so...

Vector3[] ArchimedeanSpiralBezier(float spacing, float startAngle, float endAngle) {
// Chop the spiral into segments, roughly this many degrees apiece.
float interval = 90f;
float angleSpan = endAngle - startAngle;
int segmentCount = Mathf.Max(Mathf.RoundToInt(Mathf.Abs(angleSpan / interval)), 2);
Vector3[] bezierPoints = new Vector3[segmentCount * 3 + 1];
float step = angleSpan / segmentCount;

// 1.05f is a fudge factor determined empirically,
// to "puff out" the curve so it doesn't cut the corner too shallowly.
float derivativeScale = step * 1.05f/3f;
// The division by 3 is because in an nth order Bezier curve,
// the velocity at an anchor point is n times the vector to the next point.

// Initialize the first anchor point on the spline.
Vector3 derivative;
bezierPoints = ArchimedeanSpiral(spacing, startAngle, out derivative);
derivative *= derivativeScale;

for(int i = 1; i <= segmentCount; i++) {
int end = i * 3;

// The next control point is the previous anchor plus the velocity.
bezierPoints[end - 2] = bezierPoints[end - 3] + derivative;

// Place the next anchor point.
float angle = startAngle + i * step;
bezierPoints[end] = ArchimedeanSpiral(spacing, angle, out derivative);
derivative *= derivativeScale;

// Backtrack from this anchor point by the velocity to place its control point.
bezierPoints[end - 1] = bezierPoints[end] - derivative;
}

return bezierPoints;
}


For a logarithmic spiral, the same principles apply, just with a different utility function:

Vector3 LogarithmicSpiral(float spacing, float angle, out Vector3 derivative) {