Algorithms for penrose tiling patterns

[daniel.tran]

Hello,
I was hoping to restart this thread from the user spinvector:

Processing 2.x and 3.x Forum

I want to ask if anyone has any experience in this. They appear to be quite tricky to generate, as they don’t have translation symmetries. So I don’t believe I can use a decomposition scheme to generate a pattern.

I’d like to start with a pattern that ignores matching rules, like the one seen here (on the right):

This image has been resized to fit in the page. Click to enlarge.

I’m thinking at any point P, I can surround P with shapes, and each vertex of the new shapes become new P’s, which in turn get filled with shapes, etc. Does that sound like a good approach?

Thanks.

[paulgoux]

Perhaps this might help.

Help a newbie with Penrose tilling

Hello guys, i have been trying to draw this Penrose tile, I already got the pentagon but now i’m stuck with the other figure. Any help? I’m new to this. [Capture] By the way here’s the code: void setup(){ size(400,400); } void draw(){ beginShape(); vertex(100,100); vertex(140,100); vertex(140+40sin(0.314159),100-40cos(0.314159)); vertex(120,100-40cos(0.314159)-40cos(0.942478)); vertex(100-40sin(0.314159),100-40cos(0.314159)); vertex(100,100);; endShape(); }

Remember this forum has a search function.

[daniel.tran]

Yes, I’m familiar with the search function. Unfortunately spinvector does not appear in any search results. I also found the pentose tiling post you shared via the search function and felt it wasn’t so relevant to spinvector’s post and better off as a separate thread . The post you suggest uses the “kite + dart” variation of penrose tiling and is not focusing on generating aperiodic tiling patterns as this post was/is.

[Chrisir]

@daniel.tran

Does that sound like a good approach?

I suggest to read the Wikipedia articles first and do some research