3
$\begingroup$

Given a starting Penrose tile, I need to build a "spiraling" tessellation around it.

The following picture illustrates the request:

enter image description here

In this example, the starting tile is a "thin rhombus" (the pink one).

I need to write an algorithm which is able to generate the $n$ tiles (and whose output is, for instance a, SVG file), starting from any given tile, and with the possibility of coloring the tiles according to a given sequence of $n$ colors.

Thanks for your help!

NOTE: This post is related to this one.

$\endgroup$
  • 1
    $\begingroup$ From a graph-point-of-view, you are traversing the dual-graph of the tiling, with the convention of taking the right-most turn each time. $\endgroup$ – Alex R. Sep 10 '18 at 19:07
  • $\begingroup$ @AlexR. The dual graph is the network of the centers of the tiles, right? In this case, the problem becomes how to predict the $n$-th center, right? $\endgroup$ – user559615 Sep 10 '18 at 19:11
  • $\begingroup$ How is your penrose tiling stored? $\endgroup$ – Alex R. Sep 10 '18 at 20:46
  • $\begingroup$ So far I made a Xfig file (mcj.sourceforge.net), which can be easily transformed into a SVG file and viceversa, perhaps more common. In practice, for each tile I have 4 points. But I'm not sure it is the best way to store it. $\endgroup$ – user559615 Sep 10 '18 at 21:10
  • $\begingroup$ Say, I would prefer not to store the underlying Penrose tiling, but to generate the next tile from first principles, a bit as i tried to depict in the figure above. $\endgroup$ – user559615 Sep 10 '18 at 21:16

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy