3 ms·
What do you think about this approach. Given a curve, find the Bezier control points which describe it, using SGD: https://nhq.github.io/beezy/public/ https://
by NHQ 6y ago
What do you think about this approach. Given a curve, find the Bezier control points which describe it, using SGD: https://nhq.github.io/beezy/public/ https://nhq.github.io/beezy/public/
- raphlinus 6y agoMy blog post is basically an angry rant against this kind of technique, though it's polite and civil in tone :) Basically, it's slow because it takes a number of iterations instead of directly calculating the best-matching curve, and it can fall into a local minimum and fail to attain the global optimum in case it's in one of the other two of triplets of similar shapes characteristic of cubic Béziers.