Automated build

docs/index.html

@@ -38,7 +38,7 @@
 		<meta property="og:locale" content="en-GB" />
 		<meta property="og:type" content="article" />
 		<meta property="og:published_time" content="2013-06-13T12:00:00+00:00" />
-		<meta property="og:updated_time" content="2020-11-22T18:19:03+00:00" />
+		<meta property="og:updated_time" content="2020-11-27T19:12:46+00:00" />
 		<meta property="og:author" content="Mike 'Pomax' Kamermans" />
 		<meta property="og:section" content="Bézier Curves" />
 		<meta property="og:tag" content="Bézier Curves" />
@@ -6337,9 +6337,10 @@ for (coordinate, index) in LUT:
 
 					<p>
 						After this runs, we know that <code>LUT[i]</code> is the coordinate on the curve <em>in our LUT</em> that is closest to the point we want
-						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that LUT[i] is a
+						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that
-						better guess than both LUT[i-1] and LUT[i+1], but there might be an even better projection <em>somewhere else</em> between those two
+						<code>LUT[i]</code> is a better guess than both <code>LUT[i-1]</code> and <code>LUT[i+1]</code>, but there might be an even better
-						values, so that's what we're going to be testing for, using a variation of the binary search.
+						projection <em>somewhere else</em> between those two values, so that's what we're going to be testing for, using a variation of the binary
+						search.
 					</p>
 					<ol>
 						<li>
@@ -6628,7 +6629,7 @@ findClosest(start, p, r, LUT):
 					</table>
 
 					<p>
-						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to out
+						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to our
 						<code>start</code> index) we can find a local minimum for the difference between "the distance from the curve to the circle center", and
 						the circle's radius. We track this by looking at three values (associated with the indices <code>index-2</code>, <code>index-1</code>, and
 						<code>index</code>), and we know we've found a local minimum if the three values show that the middle value (<code>pd1</code>) is less

docs/ja-JP/index.html

@@ -41,7 +41,7 @@
 		<meta property="og:locale" content="ja-JP" />
 		<meta property="og:type" content="article" />
 		<meta property="og:published_time" content="2013-06-13T12:00:00+00:00" />
-		<meta property="og:updated_time" content="2020-11-22T18:19:03+00:00" />
+		<meta property="og:updated_time" content="2020-11-27T19:12:46+00:00" />
 		<meta property="og:author" content="Mike 'Pomax' Kamermans" />
 		<meta property="og:section" content="Bézier Curves" />
 		<meta property="og:tag" content="Bézier Curves" />
@@ -6477,9 +6477,10 @@ for (coordinate, index) in LUT:
 
 					<p>
 						After this runs, we know that <code>LUT[i]</code> is the coordinate on the curve <em>in our LUT</em> that is closest to the point we want
-						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that LUT[i] is a
+						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that
-						better guess than both LUT[i-1] and LUT[i+1], but there might be an even better projection <em>somewhere else</em> between those two
+						<code>LUT[i]</code> is a better guess than both <code>LUT[i-1]</code> and <code>LUT[i+1]</code>, but there might be an even better
-						values, so that's what we're going to be testing for, using a variation of the binary search.
+						projection <em>somewhere else</em> between those two values, so that's what we're going to be testing for, using a variation of the binary
+						search.
 					</p>
 					<ol>
 						<li>
@@ -6775,7 +6776,7 @@ findClosest(start, p, r, LUT):
 					</table>
 
 					<p>
-						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to out
+						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to our
 						<code>start</code> index) we can find a local minimum for the difference between "the distance from the curve to the circle center", and
 						the circle's radius. We track this by looking at three values (associated with the indices <code>index-2</code>, <code>index-1</code>, and
 						<code>index</code>), and we know we've found a local minimum if the three values show that the middle value (<code>pd1</code>) is less

docs/news/2020-09-18.html

@@ -33,8 +33,8 @@
 		<meta property="og:description" content="Rewriting the tech stack" />
 		<meta property="og:locale" content="en-GB" />
 		<meta property="og:type" content="article" />
-		<meta property="og:published_time" content="Thu Sep 17 2020 17:00:00 +00:00" />
+		<meta property="og:published_time" content="Fri Sep 18 2020 00:00:00 +00:00" />
-		<meta property="og:updated_time" content="Sun Nov 22 2020 10:19:03 +00:00" />
+		<meta property="og:updated_time" content="Fri Nov 27 2020 19:12:47 +00:00" />
 		<meta property="og:author" content="Mike 'Pomax' Kamermans" />
 		<meta property="og:section" content="Bézier Curves" />
 		<meta property="og:tag" content="Bézier Curves" />

docs/news/2020-11-22.html

@@ -33,8 +33,8 @@
 		<meta property="og:description" content="Curve-circle intersections" />
 		<meta property="og:locale" content="en-GB" />
 		<meta property="og:type" content="article" />
-		<meta property="og:published_time" content="Sat Nov 21 2020 16:00:00 +00:00" />
+		<meta property="og:published_time" content="Sun Nov 22 2020 00:00:00 +00:00" />
-		<meta property="og:updated_time" content="Sun Nov 22 2020 10:19:03 +00:00" />
+		<meta property="og:updated_time" content="Fri Nov 27 2020 19:12:47 +00:00" />
 		<meta property="og:author" content="Mike 'Pomax' Kamermans" />
 		<meta property="og:section" content="Bézier Curves" />
 		<meta property="og:tag" content="Bézier Curves" />

docs/news/index.html

@@ -33,7 +33,7 @@
 		<meta property="og:description" content="" />
 		<meta property="og:locale" content="en-GB" />
 		<meta property="og:type" content="article" />
-		<meta property="og:published_time" content="Sun Nov 22 2020 10:19:03 GMT-0800 (Pacific Standard Time)" />
+		<meta property="og:published_time" content="Fri Nov 27 2020 19:12:47 GMT+0000 (Coordinated Universal Time)" />
 		<meta property="og:updated_time" content="" />
 		<meta property="og:author" content="Mike 'Pomax' Kamermans" />
 		<meta property="og:section" content="Bézier Curves" />

docs/news/rss.xml

@@ -6,7 +6,7 @@
   <atom:link href="https://pomax.github.io/bezierinfo" rel="self"></atom:link>
   <description>News updates for the <a href="https://pomax.github.io/bezierinfo">primer on Bézier Curves</a> by Pomax</description>
   <language>en-GB</language>
-  <lastBuildDate>Sun Nov 22 2020 10:19:03 +00:00</lastBuildDate>
+  <lastBuildDate>Fri Nov 27 2020 19:12:47 +00:00</lastBuildDate>
   <image>
     <url>https://pomax.github.io/bezierinfo/images/og-image.png</url>
     <title>A Primer on Bézier Curves</title>
@@ -23,7 +23,7 @@
 &lt;p&gt;— &lt;a href=&quot;https://twitter.com/TheRealPomax&quot;&gt;Pomax&lt;/a&gt;&lt;/p&gt;
 
     </description>
-    <pubDate>Sat Nov 21 2020 16:00:00 +00:00</pubDate>
+    <pubDate>Sun Nov 22 2020 00:00:00 +00:00</pubDate>
     <guid>2020-11-22.html</guid>
   </item><item>
     <title>Rewriting the tech stack</title>
@@ -119,7 +119,7 @@ draw() {
 &lt;p&gt;— &lt;a href=&quot;https://twitter.com/TheRealPomax&quot;&gt;Pomax&lt;/a&gt;&lt;/p&gt;
 
     </description>
-    <pubDate>Thu Sep 17 2020 17:00:00 +00:00</pubDate>
+    <pubDate>Fri Sep 18 2020 00:00:00 +00:00</pubDate>
     <guid>2020-09-18.html</guid>
   </item>
 </channel>

docs/uk-UA/index.html

@@ -39,7 +39,7 @@
 		<meta property="og:locale" content="uk-UA" />
 		<meta property="og:type" content="article" />
 		<meta property="og:published_time" content="2013-06-13T12:00:00+00:00" />
-		<meta property="og:updated_time" content="2020-11-22T18:19:03+00:00" />
+		<meta property="og:updated_time" content="2020-11-27T19:12:46+00:00" />
 		<meta property="og:author" content="Mike 'Pomax' Kamermans" />
 		<meta property="og:section" content="Bézier Curves" />
 		<meta property="og:tag" content="Bézier Curves" />
@@ -6612,9 +6612,10 @@ for (coordinate, index) in LUT:
 
 					<p>
 						After this runs, we know that <code>LUT[i]</code> is the coordinate on the curve <em>in our LUT</em> that is closest to the point we want
-						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that LUT[i] is a
+						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that
-						better guess than both LUT[i-1] and LUT[i+1], but there might be an even better projection <em>somewhere else</em> between those two
+						<code>LUT[i]</code> is a better guess than both <code>LUT[i-1]</code> and <code>LUT[i+1]</code>, but there might be an even better
-						values, so that's what we're going to be testing for, using a variation of the binary search.
+						projection <em>somewhere else</em> between those two values, so that's what we're going to be testing for, using a variation of the binary
+						search.
 					</p>
 					<ol>
 						<li>
@@ -6910,7 +6911,7 @@ findClosest(start, p, r, LUT):
 					</table>
 
 					<p>
-						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to out
+						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to our
 						<code>start</code> index) we can find a local minimum for the difference between "the distance from the curve to the circle center", and
 						the circle's radius. We track this by looking at three values (associated with the indices <code>index-2</code>, <code>index-1</code>, and
 						<code>index</code>), and we know we've found a local minimum if the three values show that the middle value (<code>pd1</code>) is less

docs/zh-CN/index.html

@@ -41,7 +41,7 @@
 		<meta property="og:locale" content="zh-CN" />
 		<meta property="og:type" content="article" />
 		<meta property="og:published_time" content="2013-06-13T12:00:00+00:00" />
-		<meta property="og:updated_time" content="2020-11-22T18:19:03+00:00" />
+		<meta property="og:updated_time" content="2020-11-27T19:12:46+00:00" />
 		<meta property="og:author" content="Mike 'Pomax' Kamermans" />
 		<meta property="og:section" content="Bézier Curves" />
 		<meta property="og:tag" content="Bézier Curves" />
@@ -6453,9 +6453,10 @@ for (coordinate, index) in LUT:
 
 					<p>
 						After this runs, we know that <code>LUT[i]</code> is the coordinate on the curve <em>in our LUT</em> that is closest to the point we want
-						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that LUT[i] is a
+						to project, so that's a pretty good initial guess as to what the best projection onto our curve is. To refine it, we note that
-						better guess than both LUT[i-1] and LUT[i+1], but there might be an even better projection <em>somewhere else</em> between those two
+						<code>LUT[i]</code> is a better guess than both <code>LUT[i-1]</code> and <code>LUT[i+1]</code>, but there might be an even better
-						values, so that's what we're going to be testing for, using a variation of the binary search.
+						projection <em>somewhere else</em> between those two values, so that's what we're going to be testing for, using a variation of the binary
+						search.
 					</p>
 					<ol>
 						<li>
@@ -6751,7 +6752,7 @@ findClosest(start, p, r, LUT):
 					</table>
 
 					<p>
-						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to out
+						In words: given a <code>start</code> index, the circle center and radius, and our LUT, we check where (closest to our
 						<code>start</code> index) we can find a local minimum for the difference between "the distance from the curve to the circle center", and
 						the circle's radius. We track this by looking at three values (associated with the indices <code>index-2</code>, <code>index-1</code>, and
 						<code>index</code>), and we know we've found a local minimum if the three values show that the middle value (<code>pd1</code>) is less