[alogo] Minkowski Sausage

The fractal resulting by replacing each side of the square with the broken line shown and applying this procedure repeatedly on the resulting polygons. Below is a collection of the 7 first such polygons. Their side-number is s(n) = 4*3^n. The last polygon having s(7) = 8748 sides.

[0_0] [0_1] [0_2] [0_3]
[1_0] [1_1] [1_2] [1_3]
[2_0] [2_1] [2_2] [2_3]
[3_0] [3_1] [3_2] [3_3]
[4_0] [4_1] [4_2] [4_3]
[5_0] [5_1] [5_2] [5_3]
[6_0] [6_1] [6_2] [6_3]
[7_0] [7_1] [7_2] [7_3]
[8_0] [8_1] [8_2] [8_3]
[9_0] [9_1] [9_2] [9_3]
[10_0] [10_1] [10_2] [10_3]
[11_0] [11_1] [11_2] [11_3]



Produced with EucliDraw©