In Layman’s terms, Fractals are beautiful patterns brought into existence upon the intertwining of computation and mathematics. To get a bit technical they are recursive in nature such that when looked upon a certain subset of a given fractal a similar pattern appears to emerge out of it.
In this article, a new type of fractal pattern is generated, given as below:
- Recursively go to the end branch of a Fractal tree.
- When the length of the branch reaches our threshold value, draw out that particular branch and exit out of the function.
- To keep the colors similar for a few iterations, we use type casting since ((colorVal%15000)/1000+1) would give out spectrums of same values, i.e. same colour thousand times before it iterates.
Below is the implementation of the above approach:
- Julia Fractal set in C/C++ Using Graphics
- Snowflakes Fractal using Python
- Fractal using Spirograph in Python
- Fractal Trees in Python
- Julia fractal in Python
- Mandelbrot Fractal Set visualization in Python
- bar() function in C graphics
- Mandlebrot Set in C/C++ Using Graphics
- bar3d() function in C graphics
- Flood fill algorithm using C graphics
- How to discretize an Ellipse or Circle to a Polygon using C++ Graphics?
- Draw an Ellipse rotating over a Circle in C++ graphics
- How can we write main as a class in C++?
- Count of Subsets of a given Set with element X present in it
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.