From bb1bf14e75cae15956651cee55b8f996bb8be76d Mon Sep 17 00:00:00 2001 From: Pomax Date: Fri, 9 Apr 2021 09:40:50 -0700 Subject: [PATCH] smaller btc CTA --- docs/index.html | 56 +++++++++++++++++-------------- docs/ja-JP/index.html | 56 +++++++++++++++++-------------- 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 | 56 +++++++++++++++++-------------- docs/style.css | 21 ++++++++++-- docs/uk-UA/index.html | 56 +++++++++++++++++-------------- docs/zh-CN/index.html | 56 +++++++++++++++++-------------- src/html/fragments/donations.html | 20 +++++++---- 11 files changed, 189 insertions(+), 148 deletions(-) diff --git a/docs/index.html b/docs/index.html index 051d7c4c..9d2353ca 100644 --- a/docs/index.html +++ b/docs/index.html @@ -38,7 +38,7 @@ - + @@ -155,10 +155,6 @@

Donations and sponsorship

- - - -

If this is a resource that you're using for research, as work reference, or even writing your own software, please consider donating (any amount helps) or @@ -171,13 +167,25 @@ sponsoring the site! I am more than happy to work with your finance department on sponsorship invoicing and recognition.

-

Bitcoin donations:

- -

- If you prefer to donate via Bitcoin, you can donate either directly to - 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu - or use the QR code on the right, if that's the kind of convenience you prefer =) -

+
+
+

+ Bitcoin donations: +

+

+ If you prefer to donate via Bitcoin, you can donate either directly to + 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu + or use the QR code on the right, if that's the kind of convenience you prefer =) +

+
+
+ + + +
+

@@ -5886,13 +5894,9 @@ lli = function(line1, line2): >,C2.2). -
  • - 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. -
    -
    • +
  • 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.
  • 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 @@ -9197,13 +9201,13 @@ for p = 1 to points.length-3 (inclusive):

    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} -
        -
      • 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}.
        • -
      -
      3. +
    3. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
      4. +
    + +
    1. 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 29461035..be0814f3 100644 --- a/docs/ja-JP/index.html +++ b/docs/ja-JP/index.html @@ -41,7 +41,7 @@ - + @@ -158,10 +158,6 @@

      Donations and sponsorship

      - - - -

      If this is a resource that you're using for research, as work reference, or even writing your own software, please consider donating (any amount helps) or @@ -174,13 +170,25 @@ sponsoring the site! I am more than happy to work with your finance department on sponsorship invoicing and recognition.

      -

      Bitcoin donations:

      - -

      - If you prefer to donate via Bitcoin, you can donate either directly to - 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu - or use the QR code on the right, if that's the kind of convenience you prefer =) -

      +
      +
      +

      + Bitcoin donations: +

      +

      + If you prefer to donate via Bitcoin, you can donate either directly to + 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu + or use the QR code on the right, if that's the kind of convenience you prefer =) +

      +
      +
      + + + +
      +

      @@ -5992,13 +6000,9 @@ lli = function(line1, line2): >,C2.2).
      2. -
    2. - 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. -
      -
      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. 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 @@ -9422,13 +9426,13 @@ for p = 1 to points.length-3 (inclusive):

      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} -
          -
        • 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}.
          • -
        -
        3. +
      3. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
        4. +
      +
        +
      • 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. 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 e659c35d..df633d53 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 db0948ff..f67aec2e 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 199ce8cd..94ce2b3d 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 63994c4a..1bdf034c 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 - Fri Mar 26 2021 00:54:44 +00:00 + Fri Apr 09 2021 09:39:33 +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> - Sun Nov 22 2020 00:00:00 +00:00 + Sat Nov 21 2020 16: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> - Fri Sep 18 2020 00:00:00 +00:00 + Thu Sep 17 2020 17:00:00 +00:00 2020-09-18.html diff --git a/docs/ru-RU/index.html b/docs/ru-RU/index.html index fc990482..d02aa59e 100644 --- a/docs/ru-RU/index.html +++ b/docs/ru-RU/index.html @@ -34,7 +34,7 @@ - + @@ -148,10 +148,6 @@

        Donations and sponsorship

        - - - -

        Ежели сей ресурс помог вам в ваших исследованиях или в написании собственной программы рассмотрите возможность задонатить @@ -161,13 +157,25 @@ счастливой жизни этого ресурса.

        -

        Bitcoin donations:

        - -

        - If you prefer to donate via Bitcoin, you can donate either directly to - 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu - or use the QR code on the right, if that's the kind of convenience you prefer =) -

        +
        +
        +

        + Bitcoin donations: +

        +

        + If you prefer to donate via Bitcoin, you can donate either directly to + 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu + or use the QR code on the right, if that's the kind of convenience you prefer =) +

        +
        +
        + + + +
        +

        @@ -6149,13 +6157,9 @@ lli = function(line1, line2): >,C2.2).
        2. -
      2. - 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. -
        -
        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. 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 @@ -9579,13 +9583,13 @@ for p = 1 to points.length-3 (inclusive):

        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} -
            -
          • 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}.
            • -
          -
          3. +
        3. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
          4. +
        +
          +
        • 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. 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/style.css b/docs/style.css index 3d411c21..6a885564 100644 --- a/docs/style.css +++ b/docs/style.css @@ -485,9 +485,24 @@ a.rss-link { /* --------------------- */ -a.btcqr { - float: right; - margin-left: 1em; +div.btcfh { + display: flex; + flex-direction: row; +} + +div.btcqr { + flex: 0 0 auto; + margin-top: 1em; + align-self: center; +} + +div.btcqr a { + text-decoration: none; + padding-left: 0.5em; +} + +div.btcqr img { + width: 50%; } a.btclk { diff --git a/docs/uk-UA/index.html b/docs/uk-UA/index.html index 4dbe55a0..68a3dab5 100644 --- a/docs/uk-UA/index.html +++ b/docs/uk-UA/index.html @@ -39,7 +39,7 @@ - + @@ -153,10 +153,6 @@

          Donations and sponsorship

          - - - -

          Якщо ви використовуєте цей ресурс для наукових досліджень, або пишете власне програмне забезпечення, будь ласка, розгляньте можливість фінансової підтримки (будь-яка сума @@ -165,13 +161,25 @@ багато буде потрібно. Тому, якщо можете допомогти з кавою, то можете бути впевнені, що цей ресурс буде підтримуватися ще довго!

          -

          Bitcoin donations:

          - -

          - If you prefer to donate via Bitcoin, you can donate either directly to - 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu - or use the QR code on the right, if that's the kind of convenience you prefer =) -

          +
          +
          +

          + Bitcoin donations: +

          +

          + If you prefer to donate via Bitcoin, you can donate either directly to + 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu + or use the QR code on the right, if that's the kind of convenience you prefer =) +

          +
          +
          + + + +
          +

          @@ -6123,13 +6131,9 @@ lli = function(line1, line2): >,C2.2).
          2. -
        2. - 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. -
          -
          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. 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 @@ -9553,13 +9557,13 @@ for p = 1 to points.length-3 (inclusive):

          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} -
              -
            • 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}.
              • -
            -
            3. +
          3. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
            4. +
          +
            +
          • 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. 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 d296b1d4..528bc26e 100644 --- a/docs/zh-CN/index.html +++ b/docs/zh-CN/index.html @@ -41,7 +41,7 @@ - + @@ -158,10 +158,6 @@

            Donations and sponsorship

            - - - -

            If this is a resource that you're using for research, as work reference, or even writing your own software, please consider donating (any amount helps) or @@ -174,13 +170,25 @@ sponsoring the site! I am more than happy to work with your finance department on sponsorship invoicing and recognition.

            -

            Bitcoin donations:

            - -

            - If you prefer to donate via Bitcoin, you can donate either directly to - 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu - or use the QR code on the right, if that's the kind of convenience you prefer =) -

            +
            +
            +

            + Bitcoin donations: +

            +

            + If you prefer to donate via Bitcoin, you can donate either directly to + 3GY1HbQ2cH9V4xBLnRYdEfc42Nd1ZyjLZu + or use the QR code on the right, if that's the kind of convenience you prefer =) +

            +
            +
            + + + +
            +

            @@ -5968,13 +5976,9 @@ lli = function(line1, line2): >,C2.2).
            2. -
          2. - 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. -
            -
            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. 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 @@ -9398,13 +9402,13 @@ for p = 1 to points.length-3 (inclusive):

            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} -
                -
              • 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}.
                • -
              -
              3. +
            3. That'll fail, so we retry with the interval halved: {0, 0.25, 0.5}
              4. +
            +
              +
            • 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. 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/src/html/fragments/donations.html b/src/html/fragments/donations.html index dddec9cf..6281c2f8 100644 --- a/src/html/fragments/donations.html +++ b/src/html/fragments/donations.html @@ -1,13 +1,19 @@

              {{ donationsHeading }}

              - - - - {{ donationCTA }} -

              {{ bitcoinHeading }}

              - -{{ bitcoinCTA }} +
              +
              +

              + {{ bitcoinHeading }} +

              + {{ bitcoinCTA }} +
              +
              + + + +
              +