How to draw a Sierpinski triangle using python?

[23394 views]

Sierpinski triangle is also known as Sierpinski gasket and Sierpinski sieve. It is the object that is made after many iterations. It is basically a fractal and attractive fixed set. Its overall shape looks similar to an equilateral triangle.

Let's learn to draw Sierpinski triangle using python and turtle module. The first description of this triangle was given by a polish mathematician Waclaw Sierpinski in 1915. The shape is named after him. In this tutorial, you will learn about recursion, the Sierpinski triangle, and the turtle module.

What is the Sierpinski triangle?

Sierpinski triangle may look complex to you but it’s easy to make a shape with the help of repetition. You can use the recursive function and the turtle module of python to generate the Sierpinski triangle pattern. It’s the best and the simplest way of drawing it. However, the much easier way is by using your hands. Simply, start by drawing a large triangle on a paper. Now, it should be divided into four new triangles by joining the midpoint of each side. By applying the same process to the other three triangles at the corner, one can make a Sierpinski triangle.

Another way of drawing Sierpinski triangle in python is by using python tinkter. If you want to draw Sierpinski triangle, there are many ways to do it. This problem will be asked in interviews or an exam so you must practice it.

What is recursion?

Recursion in programming refers to a function that calls itself. It is a way of solving a problem by dividing the problem into smaller problems and then finding the appropriate solution to it. A recursive algorithm is used to solve many problems. In recursion, programmers have to define a base case. It is used to stop the function from calling itself. If not defined, then the code will keep running. Recursion is quite helpful in programming. However, recursion can’t be used to solve every problem. We are going to use it for drawing Sierpinski triangle.

Code for drawing Sierpinski triangle

# Program to print Sierpinski Triangle import turtle def drawTriangle(points,color,myTurtle): myTurtle.fillcolor(color) myTurtle.up() myTurtle.goto(points[0][0],points[0][1]) myTurtle.down() myTurtle.begin_fill() myTurtle.goto(points[1][0],points[1][1]) myTurtle.goto(points[2][0],points[2][1]) myTurtle.goto(points[0][0],points[0][1]) myTurtle.end_fill() def mid(p1,p2): return ( (p1[0]+p2[0]) / 2, (p1[1] + p2[1]) / 2) def drawsierpinski(points,degree,myTurtle): colormap = ['blue','red','green','white','yellow', 'violet','orange'] drawTriangle(points,colormap[degree],myTurtle) if degree > 0: drawsierpinski([points[0], mid(points[0], points[1]), mid(points[0], points[2])], degree-1, myTurtle) drawsierpinski([points[1], mid(points[0], points[1]), mid(points[1], points[2])], degree-1, myTurtle) drawsierpinski([points[2], mid(points[2], points[1]), mid(points[0], points[2])], degree-1, myTurtle) def main(): myTurtle = turtle.Turtle() myscreen = turtle.Screen() myPoints = [[-100,-50],[0,100],[100,-50]] drawsierpinski(myPoints,3,myTurtle) myscreen.exitonclick() main()

In the above code, the outer triangle will get drawn with the help of the sierpinski function. As you can see, three recursive calls exist in the code. One is for every new corner triangle that you will get after joining the midpoints. To understand the code, imagine that the corners have been ordered lower left, top, lower right.

Output

The way the sierpinski function calls itself, it starts drawing from the smallest triangle in the lower-left corner. After that, it fills out the rest of the triangles going back. Now, the top corner will be filled starting from the smallest topmost triangle. In the end, it fills the lower right corner beginning from the smallest triangle. Sierpinski function depends on the getmid function. The begin_fill and end_fill turtle method draws a filled triangle.