Nested Sierpinski Polygons

by Simon Whitechapel

The construction is to create a nest of a particular polygon with n layers, rotating the polygon through some angle for each new layer, then step through the layers 1 to n, n to 1 finding the “Sierpiński point” in each (vertex chosen at random, move half distance toward it, then use position for next layer). But only plot the point for a particular layer. The second image here has two layers of triangles and plots the point for layer 1, and the last has has six layers of hexagons and plots the point for layer 6.

vertex = 3; layer = 1; drawlayer = 1

v = 3; l = 2; dl = 1 (l = 1...2...1...)

v = 3; l = 2; dl = 2

v = 4; l = 2; dl = 1

v = 6; l = 6; dl = 6 (l = 1...6...1...)

More Sierpinski Polygons

Fractals Index

Maths Index

Main Index