diff --git a/docs/chapters/decasteljau/content.en-GB.md b/docs/chapters/decasteljau/content.en-GB.md index 0f8b9196..893ec14f 100644 --- a/docs/chapters/decasteljau/content.en-GB.md +++ b/docs/chapters/decasteljau/content.en-GB.md @@ -23,23 +23,23 @@ To see this in action, move the slider for the following sketch to changes which ### How to implement de Casteljau's algorithm -Let's just use the algorithm we just specified, and implement that: +Let's just use the algorithm we just specified, and implement that as a function that can take a list of curve-defining points, and a `t` value, and draws the associated point on the curve for that `t` value: ``` -function drawCurve(points[], t): +function drawCurvePoint(points[], t): if(points.length==1): draw(points[0]) else: newpoints=array(points.size-1) for(i=0; it ratios (i.e. the "markers" outlined in the above algorithm), and then call the draw function for this new list.