| Iterated Function Systems Larry Riddle |
|
||||||||||
|
Sierpinski Pentagon | ||||||||||
|
This construction is similar to the construction of the Sierpinski
gasket by scaling a triangle and translating three copies. In this
case we want to scale a pentagon P(0) and translate five
copies. The five smaller pentagons (shown in red) are placed so that
they fit inside the larger pentagon (outlined in black) as
illustrated in the following figure.
Now repeat these steps on the new set P(1). Here are the first three iterations.
The Sierpinski pentagon is the limiting set for this construction. | ||||||||||
![]() |
The scale factor for each function is
| ||||||||||
![]() |
We have a hyperbolic IFS with five maps, each a similitude of
ratio r < 1. Therefore the similarity dimension, d,
of the attractor of the IFS is the solution to
| ||||||||||
![]() |
Sierpinski n-gonsBy changing the initial polygon and scale factor, it is possible to generate other types of fractals. The idea is to start with a regular n-sided polygon, then scale the polygon by a factor r so that n copies of the scaled polygon exactly fit inside the original polygon. The Sierpinski pentagon is such an example with n = 5 and r = 0.381966. The figure below shows the limit set for a hexagon as the initial polygon.
Durer's pentagonsIn 1525, the great Renaissance artist Albrecht Durer published The Painter's Manual in which he illustrated various ways for drawing geometric figures. One section is on "Tile Patterns Formed by Pentagons". Durer's description forms the basis for the attractor of an iterated function system.
| ||||||||||
![]() |
|
||||||||||
|
|||||||||||
|
|