From 316d82b107034427962ca80c0a9dba76967ef94f Mon Sep 17 00:00:00 2001 From: Bezierinfo CI Date: Thu, 26 Aug 2021 16:34:52 +0000 Subject: [PATCH] Automated build --- docs/index.html | 19 +++++++++++-------- docs/ja-JP/index.html | 2 +- docs/news/2020-09-18.html | 2 +- docs/news/2020-11-22.html | 2 +- docs/news/index.html | 2 +- docs/news/rss.xml | 2 +- docs/ru-RU/index.html | 2 +- docs/uk-UA/index.html | 19 +++++++++++-------- docs/zh-CN/index.html | 2 +- 9 files changed, 29 insertions(+), 23 deletions(-) diff --git a/docs/index.html b/docs/index.html index 2ec63feb..634388e9 100644 --- a/docs/index.html +++ b/docs/index.html @@ -38,7 +38,7 @@ - + @@ -1688,21 +1688,24 @@ function RationalBezier(3,t,w[],r[]):

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: +

@@ -1730,8 +1733,8 @@ function drawCurve(points[], t):
1

- And done, that's the algorithm implemented. Except usually you don't get the luxury of overloading the "+" operator, so let's also give - the code for when you need to work with x and y values: + And done, that's the algorithm implemented. Although: usually you don't get the luxury of overloading the "+" operator, so let's also + give the code for when you need to work with x and y values separately:

@@ -1739,7 +1742,7 @@ function drawCurve(points[], t): diff --git a/docs/ja-JP/index.html b/docs/ja-JP/index.html index 45745770..1a53f4b3 100644 --- a/docs/ja-JP/index.html +++ b/docs/ja-JP/index.html @@ -41,7 +41,7 @@ - + diff --git a/docs/news/2020-09-18.html b/docs/news/2020-09-18.html index 833fa681..243bc88d 100644 --- a/docs/news/2020-09-18.html +++ b/docs/news/2020-09-18.html @@ -34,7 +34,7 @@ - + diff --git a/docs/news/2020-11-22.html b/docs/news/2020-11-22.html index c8165c9f..d4c49a15 100644 --- a/docs/news/2020-11-22.html +++ b/docs/news/2020-11-22.html @@ -34,7 +34,7 @@ - + diff --git a/docs/news/index.html b/docs/news/index.html index 7d2fc9c4..7da584c6 100644 --- a/docs/news/index.html +++ b/docs/news/index.html @@ -33,7 +33,7 @@ - + diff --git a/docs/news/rss.xml b/docs/news/rss.xml index 4bc867c0..35cacea6 100644 --- a/docs/news/rss.xml +++ b/docs/news/rss.xml @@ -6,7 +6,7 @@ News updates for the primer on Bézier Curves by Pomaxen-GB - Wed Aug 25 2021 14:37:34 +00:00 + Thu Aug 26 2021 16:34:14 +00:00https://pomax.github.io/bezierinfo/images/og-image.pngA Primer on Bézier Curves diff --git a/docs/ru-RU/index.html b/docs/ru-RU/index.html index aafe66e3..72de6a21 100644 --- a/docs/ru-RU/index.html +++ b/docs/ru-RU/index.html @@ -34,7 +34,7 @@ - + diff --git a/docs/uk-UA/index.html b/docs/uk-UA/index.html index 99701304..da6e90d3 100644 --- a/docs/uk-UA/index.html +++ b/docs/uk-UA/index.html @@ -39,7 +39,7 @@ - + @@ -1751,21 +1751,24 @@ function RationalBezier(3,t,w[],r[]):

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: +

1
@@ -1793,8 +1796,8 @@ function drawCurve(points[], t):
1

- And done, that's the algorithm implemented. Except usually you don't get the luxury of overloading the "+" operator, so let's also give - the code for when you need to work with x and y values: + And done, that's the algorithm implemented. Although: usually you don't get the luxury of overloading the "+" operator, so let's also + give the code for when you need to work with x and y values separately:

@@ -1802,7 +1805,7 @@ function drawCurve(points[], t): diff --git a/docs/zh-CN/index.html b/docs/zh-CN/index.html index bb4f16eb..a3d835ab 100644 --- a/docs/zh-CN/index.html +++ b/docs/zh-CN/index.html @@ -41,7 +41,7 @@ - +
1