Reference my just-published article about aperiodic tilings.

In commit 8d6647548f7d005 I added the Hats grid type to Loopy, and
mentioned in the commit message that I was very pleased with the
algorithm I came up with.

In fact, I was so pleased with it that I've decided it deserves a
proper public writeup. So I've spent the Easter weekend producing one:

  https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/aperiodic-tilings/

In this commit I adjust the header comments in both penrose.c and
hat.c to refer to the article (replacing a previous comment in
penrose.c to a much less polished page containing a copy of my
jotting-grade personal notes that I sent James Harvey once). Also,
added some code to hatgen.c to output Python hat descriptions in a
similar style to hat-test, which I used to generate a couple of the
more difficult diagrams in the new article, and didn't want to lose.
This commit is contained in:
Simon Tatham
2023-04-10 14:56:34 +01:00
parent 71cf891fdc
commit 6fb890e0ea
3 changed files with 59 additions and 6 deletions

View File

@ -2,9 +2,10 @@
*
* Penrose tile generator.
*
* Uses half-tile technique outlined on:
* Works by choosing a small patch from a recursively expanded large
* region of tiling, using one of the two algorithms described at
*
* http://tartarus.org/simon/20110412-penrose/penrose.xhtml
* https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/aperiodic-tilings/
*/
#include <assert.h>