From c81ec10cb299666694d880c21304ac269a720efb Mon Sep 17 00:00:00 2001 From: Bezierinfo CI Date: Mon, 7 Jun 2021 15:26:03 +0000 Subject: [PATCH] Automated build --- docs/index.html | 26 +++++++++++++++----------- docs/ja-JP/index.html | 26 +++++++++++++++----------- docs/news/2020-09-18.html | 4 ++-- docs/news/2020-11-22.html | 4 ++-- docs/news/index.html | 2 +- docs/news/rss.xml | 6 +++--- docs/ru-RU/index.html | 26 +++++++++++++++----------- docs/uk-UA/index.html | 26 +++++++++++++++----------- docs/zh-CN/index.html | 26 +++++++++++++++----------- 9 files changed, 83 insertions(+), 63 deletions(-) diff --git a/docs/index.html b/docs/index.html index 57507732..00a08fea 100644 --- a/docs/index.html +++ b/docs/index.html @@ -38,7 +38,7 @@ - + @@ -5895,9 +5895,13 @@ lli = function(line1, line2): >,C2.2). -
  • For each pair, check whether their bounding boxes overlap.
    • -
  • If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
    • -
  • If there is overlap, rerun all steps for this pair.
    • +
  • + For each pair, check whether their bounding boxes overlap. +
      +
    1. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
      2. +
    2. If there is overlap, rerun all steps for this pair.
      3. +
    +
  • Once the sub-curves we form are so small that they effectively occupy sub-pixel areas, we consider an intersection found, noting that we might have a cluster of multiple intersections at the sub-pixel level, out of which we pick one to act as "found" t value @@ -9574,13 +9578,13 @@ radialError(radius, points[]):

    1. We start with low=0, mid=0.5 and high=1
      2. -
    2. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
      3. -
    - -
      +
    1. + That'll fail, so we retry with the interval halved: {0, 0.25, 0.5} +
        +
      • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
        • +
      • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
        • +
      +
    2. We keep doing this over and over until we have two arcs, in sequence, of which the first arc is good, and the second arc is bad. When we find that pair, we've found the boundary between a good approximation and a bad approximation, and we pick the good arc. diff --git a/docs/ja-JP/index.html b/docs/ja-JP/index.html index ee6426db..2c1c8122 100644 --- a/docs/ja-JP/index.html +++ b/docs/ja-JP/index.html @@ -41,7 +41,7 @@ - + @@ -6001,9 +6001,13 @@ lli = function(line1, line2): >,C2.2).
      3. -
    3. For each pair, check whether their bounding boxes overlap.
      4. -
    4. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
      5. -
    5. If there is overlap, rerun all steps for this pair.
      6. +
    6. + For each pair, check whether their bounding boxes overlap. +
        +
      1. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
        2. +
      2. If there is overlap, rerun all steps for this pair.
        3. +
      +
    7. Once the sub-curves we form are so small that they effectively occupy sub-pixel areas, we consider an intersection found, noting that we might have a cluster of multiple intersections at the sub-pixel level, out of which we pick one to act as "found" t value @@ -9792,13 +9796,13 @@ radialError(radius, points[]):

      1. We start with low=0, mid=0.5 and high=1
        2. -
      2. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
        3. -
      -
        -
      • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
        • -
      • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
        • -
      -
        +
      1. + That'll fail, so we retry with the interval halved: {0, 0.25, 0.5} +
          +
        • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
          • +
        • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
          • +
        +
      2. We keep doing this over and over until we have two arcs, in sequence, of which the first arc is good, and the second arc is bad. When we find that pair, we've found the boundary between a good approximation and a bad approximation, and we pick the good arc. diff --git a/docs/news/2020-09-18.html b/docs/news/2020-09-18.html index 97cdc80c..611c1bf5 100644 --- a/docs/news/2020-09-18.html +++ b/docs/news/2020-09-18.html @@ -33,8 +33,8 @@ - - + + diff --git a/docs/news/2020-11-22.html b/docs/news/2020-11-22.html index 865a39ce..1730346a 100644 --- a/docs/news/2020-11-22.html +++ b/docs/news/2020-11-22.html @@ -33,8 +33,8 @@ - - + + diff --git a/docs/news/index.html b/docs/news/index.html index 4ab842ed..81fa9d06 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 0fc958ad..00c25144 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 Pomax en-GB - Mon Jun 07 2021 08:09:41 +00:00 + Mon Jun 07 2021 15:25:25 +00:00 https://pomax.github.io/bezierinfo/images/og-image.png A Primer on Bézier Curves @@ -23,7 +23,7 @@ <p>— <a href="https://twitter.com/TheRealPomax">Pomax</a></p> - Sat Nov 21 2020 16:00:00 +00:00 + Sun Nov 22 2020 00:00:00 +00:00 2020-11-22.html Rewriting the tech stack @@ -119,7 +119,7 @@ draw() { <p>— <a href="https://twitter.com/TheRealPomax">Pomax</a></p> - Thu Sep 17 2020 17:00:00 +00:00 + Fri Sep 18 2020 00:00:00 +00:00 2020-09-18.html diff --git a/docs/ru-RU/index.html b/docs/ru-RU/index.html index 61d4050e..03321e13 100644 --- a/docs/ru-RU/index.html +++ b/docs/ru-RU/index.html @@ -34,7 +34,7 @@ - + @@ -6158,9 +6158,13 @@ lli = function(line1, line2): >,C2.2).
        3. -
      3. For each pair, check whether their bounding boxes overlap.
        4. -
      4. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
        5. -
      5. If there is overlap, rerun all steps for this pair.
        6. +
      6. + For each pair, check whether their bounding boxes overlap. +
          +
        1. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
          2. +
        2. If there is overlap, rerun all steps for this pair.
          3. +
        +
      7. Once the sub-curves we form are so small that they effectively occupy sub-pixel areas, we consider an intersection found, noting that we might have a cluster of multiple intersections at the sub-pixel level, out of which we pick one to act as "found" t value @@ -9949,13 +9953,13 @@ radialError(radius, points[]):

        1. We start with low=0, mid=0.5 and high=1
          2. -
        2. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
          3. -
        -
          -
        • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
          • -
        • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
          • -
        -
          +
        1. + That'll fail, so we retry with the interval halved: {0, 0.25, 0.5} +
            +
          • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
            • +
          • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
            • +
          +
        2. We keep doing this over and over until we have two arcs, in sequence, of which the first arc is good, and the second arc is bad. When we find that pair, we've found the boundary between a good approximation and a bad approximation, and we pick the good arc. diff --git a/docs/uk-UA/index.html b/docs/uk-UA/index.html index f6696765..68883840 100644 --- a/docs/uk-UA/index.html +++ b/docs/uk-UA/index.html @@ -39,7 +39,7 @@ - + @@ -6132,9 +6132,13 @@ lli = function(line1, line2): >,C2.2).
          3. -
        3. For each pair, check whether their bounding boxes overlap.
          4. -
        4. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
          5. -
        5. If there is overlap, rerun all steps for this pair.
          6. +
        6. + For each pair, check whether their bounding boxes overlap. +
            +
          1. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
            2. +
          2. If there is overlap, rerun all steps for this pair.
            3. +
          +
        7. Once the sub-curves we form are so small that they effectively occupy sub-pixel areas, we consider an intersection found, noting that we might have a cluster of multiple intersections at the sub-pixel level, out of which we pick one to act as "found" t value @@ -9923,13 +9927,13 @@ radialError(radius, points[]):

          1. We start with low=0, mid=0.5 and high=1
            2. -
          2. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
            3. -
          -
            -
          • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
            • -
          • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
            • -
          -
            +
          1. + That'll fail, so we retry with the interval halved: {0, 0.25, 0.5} +
              +
            • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
              • +
            • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
              • +
            +
          2. We keep doing this over and over until we have two arcs, in sequence, of which the first arc is good, and the second arc is bad. When we find that pair, we've found the boundary between a good approximation and a bad approximation, and we pick the good arc. diff --git a/docs/zh-CN/index.html b/docs/zh-CN/index.html index 48f35f8b..1e0e0617 100644 --- a/docs/zh-CN/index.html +++ b/docs/zh-CN/index.html @@ -41,7 +41,7 @@ - + @@ -5977,9 +5977,13 @@ lli = function(line1, line2): >,C2.2).
            3. -
          3. For each pair, check whether their bounding boxes overlap.
            4. -
          4. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
            5. -
          5. If there is overlap, rerun all steps for this pair.
            6. +
          6. + For each pair, check whether their bounding boxes overlap. +
              +
            1. If their bounding boxes do not overlap, discard the pair, as there is no intersection between this pair of curves.
              2. +
            2. If there is overlap, rerun all steps for this pair.
              3. +
            +
          7. Once the sub-curves we form are so small that they effectively occupy sub-pixel areas, we consider an intersection found, noting that we might have a cluster of multiple intersections at the sub-pixel level, out of which we pick one to act as "found" t value @@ -9768,13 +9772,13 @@ radialError(radius, points[]):

            1. We start with low=0, mid=0.5 and high=1
              2. -
            2. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
              3. -
            -
              -
            • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
              • -
            • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
              • -
            -
              +
            1. + That'll fail, so we retry with the interval halved: {0, 0.25, 0.5} +
                +
              • If that arc's good, we move back up by half distance: {0, 0.375, 0.75}.
                • +
              • However, if the arc was still bad, we move down by half the distance: {0, 0.125, 0.25}.
                • +
              +
            2. We keep doing this over and over until we have two arcs, in sequence, of which the first arc is good, and the second arc is bad. When we find that pair, we've found the boundary between a good approximation and a bad approximation, and we pick the good arc.