At first it was sort of hard for me to visualize the de Casteljau Algorithm. I found this nice demo and explanation of it online. The demo's really show the curvature process and let you interact with the different endpoints: http://www.malinc.se/m/DeCasteljauAndBezier.php.
amandaawan
This case seems simple enough for a few points. However, when calculating throughout an entire plane, do we continually do this for every successive three points? If so, doesn't that mean that all points (except the edges) will not be in the final curve we draw?
KenKobayashiUCB
If you define the surface fully as a piece wise Bezier curve, then only points such as b0 and b2 in this case would appear in the final curve.
upasanachatterjee
What's super interesting here I thought was the use of repeated interpolation as a form of approximation. You get a decently smooth curve while only interpolating the first and last of the original points given.
At first it was sort of hard for me to visualize the de Casteljau Algorithm. I found this nice demo and explanation of it online. The demo's really show the curvature process and let you interact with the different endpoints: http://www.malinc.se/m/DeCasteljauAndBezier.php.
This case seems simple enough for a few points. However, when calculating throughout an entire plane, do we continually do this for every successive three points? If so, doesn't that mean that all points (except the edges) will not be in the final curve we draw?
If you define the surface fully as a piece wise Bezier curve, then only points such as b0 and b2 in this case would appear in the final curve.
What's super interesting here I thought was the use of repeated interpolation as a form of approximation. You get a decently smooth curve while only interpolating the first and last of the original points given.