# Algorithms for penrose tiling patterns

**URL:** <https://discourse.processing.org/t/algorithms-for-penrose-tiling-patterns/27741>\
**Category:** Coding Questions\
**Created:** [February 11, 2021, 8:55pm UTC](https://discourse.processing.org/t/algorithms-for-penrose-tiling-patterns/27741 "2021-02-11T20:55:40Z")\
**Posts on this page:** 4\
**Page:** 1

<div class="post-metadata">

**Author:** ![daniel.tran](https://avatars.discourse-cdn.com/v4/letter/d/ecae2f/32.png) [@daniel.tran](https://discourse.processing.org/u/daniel.tran)\
**Post date:** [February 11, 2021, 8:55pm UTC](https://discourse.processing.org/t/algorithms-for-penrose-tiling-patterns/27741/1 "2021-02-11T20:55:40Z")

</div>

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

> **[Processing 2.x and 3.x Forum](https://forum.processing.org/two/discussion/9215/algorithms-for-tiling-patterns-i-e-penrose-tiling)**
>
> Processing is an electronic sketchbook, a language and a worldwide community. This is its 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): [![](http://4.bp.blogspot.com/-r2kI0M7kIZM/U5NOBgaSzgI/AAAAAAAABmk/Btk6cqjFWgQ/s1600/periodic+and+non-periodic+tiling.png)](http://4.bp.blogspot.com/-r2kI0M7kIZM/U5NOBgaSzgI/AAAAAAAABmk/Btk6cqjFWgQ/s1600/periodic+and+non-periodic+tiling.png)

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.

---

<div class="post-metadata">

**Author:** ![paulgoux](https://avatars.discourse-cdn.com/v4/letter/p/b9bd4f/32.png) [@paulgoux](https://discourse.processing.org/u/paulgoux)\
**Post date:** [February 11, 2021, 9:01pm UTC](https://discourse.processing.org/t/algorithms-for-penrose-tiling-patterns/27741/2 "2021-02-11T21:01:15Z")

</div>

Perhaps this might help.

> [@Help a newbie with Penrose tilling](https://discourse.processing.org/t/help-a-newbie-with-penrose-tilling/2392):
>
> 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.

---

<div class="post-metadata">

**Author:** ![daniel.tran](https://avatars.discourse-cdn.com/v4/letter/d/ecae2f/32.png) [@daniel.tran](https://discourse.processing.org/u/daniel.tran)\
**Post date:** [February 11, 2021, 9:33pm UTC](https://discourse.processing.org/t/algorithms-for-penrose-tiling-patterns/27741/3 "2021-02-11T21:33:32Z")

</div>

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.

---

<div class="post-metadata">

**Author:** ![Chrisir](https://yyz2.discourse-cdn.com/flex036/user_avatar/discourse.processing.org/chrisir/32/45_2.png) [@Chrisir](https://discourse.processing.org/u/Chrisir)\
**Post date:** [February 11, 2021, 9:48pm UTC](https://discourse.processing.org/t/algorithms-for-penrose-tiling-patterns/27741/4 "2021-02-11T21:48:08Z")

</div>

> [@daniel.tran](#):
>
> Does that sound like a good approach?

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