Post #2454888
2026-05-09 11:09 UTC
@csk@mathstodon.xyz @pieter@mathstodon.xyz dunno where I'll find the time, but this makes me want to apply my fractal coordinates method to the turtle and/or hat tilings, since that would allow you to use a substitution-based construction while efficiently paying log (distance-from-origin) memory+time complexity no matter where you go, and only calculating what's necessary for what the user actually scrolls across...
Replies (1)
-
@csk@mathstodon.xyz 2026-05-09 19:02
@tiotasram@kolektiva.social @pieter@mathstodon.xyz That sounds similar to the method that @simontatham@hachyderm.io has presented. He discusses it on his blog starting at https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/aperiodic-tilings/. (I don't know if you have the same method in mind, but I believe Simon's would indeed require logarithmic time and space for the tiles you draw.)