Beyond the wall: working with aperiodic tilings using finite-state transducers
Read OriginalThis article details a method for working with aperiodic tilings (Penrose, hat, Spectre) using finite-state transducers and combinatorial coordinates. It presents an algorithm derived from regular-language theory that is faster and more capable than previous recursive methods, handling edge cases and generating complex tiling patches. The content includes technical explanations, implementation details, and visual examples.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes