diff options
| author | Simon Tatham <anakin@pobox.com> | 2023-04-10 14:56:34 +0100 |
|---|---|---|
| committer | Simon Tatham <anakin@pobox.com> | 2023-04-10 14:59:05 +0100 |
| commit | 6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6 (patch) | |
| tree | 1672404818caa3f82491962ad4b4ba855414d46a /penrose.c | |
| parent | 71cf891fdc3ab237ecf0e5d1aae39b6c9fe97a4d (diff) | |
| download | puzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.zip puzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.tar.gz puzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.tar.bz2 puzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.tar.xz | |
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.
Diffstat (limited to 'penrose.c')
| -rw-r--r-- | penrose.c | 5 |
1 files changed, 3 insertions, 2 deletions
@@ -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> |