Farsi / Persian
NetLogo Models Library:
The fractal that this model produces was discovered by the great Polish mathematician Waclaw Sierpinski in 1916. Sierpinski was a professor at Lvov and Warsaw. He was one of the most influential mathematicians of his time in Poland and had a worldwide reputation. One of the moon's craters is named after him.
The basic geometric construction of the Sierpinski tree goes as follows. We begin with a single point on the plane and then apply a repetitive scheme of operations to it. Grow a "spider" centered at this point by drawing three equal line segments directed to the vertices of an equilateral triangle. Then at each vertex of the triangle repeat the construction --- grow a similar "spider" only scale it down by the factor of two.
```text . Step 0: Start with a point
| | | Step 1: Grow a spider / \ / \ / \ | | /|\ / | \ | Step 2: Repeat step 1 / \ | / \ | |/ \| / \ / \
/ \ / \ ```
The Sierpinski tree is closely related to the class of fractals called Sierpinski Carpets which includes the famous Sierpinski Triangle or as it is usually called The Sierpinski Gasket.
The features that characterize the Sierpinski tree are self-similarity and connectedness. It is not always easy to determine if a fractal is connected. It took almost a decade to prove the connectedness of the famous Mandelbrot set. However connectedness is apparent from the way Sierpinski tree is generated; at each iteration the set is connected.
Push the SETUP button to clear the world and initialize globals. Press repeatedly on the GO ONCE button to perform iterations of the Sierpinski algorithm.
Notice the use of
hatch primitive which makes it so simple to generate fractals like Sierpinski tree.
Try to write a program that draws other self-similar shapes. For instance try the rule below
```text . Step 0
| | | ______________ Step 1 | | | | __|__ | | __|___________|__ Step 2 | | | | __|__ |
The resulting fractal is known in Algebraic Topology as a Universal Covering of the Figure Eight.
Notice how the curves are formed using several agents following the same rules. Also, take note of the use of the
If you mention this model or the NetLogo software in a publication, we ask that you include the citations below.
For the model itself:
Please cite the NetLogo software as:
Copyright 1998 Uri Wilensky.
This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. To view a copy of this license, visit https://creativecommons.org/licenses/by-nc-sa/3.0/ or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
Commercial licenses are also available. To inquire about commercial licenses, please contact Uri Wilensky at firstname.lastname@example.org.
This model was created as part of the project: CONNECTED MATHEMATICS: MAKING SENSE OF COMPLEX PHENOMENA THROUGH BUILDING OBJECT-BASED PARALLEL MODELS (OBPML). The project gratefully acknowledges the support of the National Science Foundation (Applications of Advanced Technologies Program) -- grant numbers RED #9552950 and REC #9632612.
This model was converted to NetLogo as part of the projects: PARTICIPATORY SIMULATIONS: NETWORK-BASED DESIGN FOR SYSTEMS LEARNING IN CLASSROOMS and/or INTEGRATED SIMULATION AND MODELING ENVIRONMENT. The project gratefully acknowledges the support of the National Science Foundation (REPP & ROLE programs) -- grant numbers REC #9814682 and REC-0126227. Converted from StarLogoT to NetLogo, 2001.