now fortunately this is no linear problem.

It's not easy to, or efficient to compute.

So we approximate this by a couple of stepwise linear computations like this.

A little bit complicated, but roughly we have two pass-

Two passes.

So one is curve- so left flow computes curvatures.

So we first compute curvatures which is a scale of values,

and then by blending or smoothing out we then get target curvatures.

So as you see, originally curvature has many variations.

But by smoothing out, you get a more uniform target curvature values.

So we tried to obtain these curvature values.

And from these curvature values, multiplied by a

surface normal, you get target Laplacian vertices, vectors.

So we try to obtain this Laplacian vectors.

In parallel, we also compute edge lengths.

So we first compute current edge lengths.

And then we compute target edge lengths, by blending or smoothing out.

And then, multiply this target edge lengths with

current edge vectors, you get target edge vectors.

And by combining these target Laplacian vectors and target edge

vectors, we solve a least squares problem and you get updated geometry.

And then we repeat multiple times, and then you get optimized smooth shape.