-
Notifications
You must be signed in to change notification settings - Fork 208
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
KochSnowflake-GuySandler #431
Conversation
The latest updates on your projects. Learn more about Vercel for Git ↗︎
|
Love to see a classic fractal. Because it's pretty well tread territory would you be able to invent your own fractal or implement a collection of well known ones? |
I added 2 more fractals should I add more? |
I added another one so I now have 4 total is it enough or should I add more? |
I'm not seeing these fractals. I mean implement more than just the koch snowflake. |
I forgot to update the github, should be updated now |
do I need to redo the PR? |
You need to add .png to the snapshot metadata filename. |
This |
done |
Congrats on earning your Blot you can order it here. |
This is a Koch Snowflake, a fractal that takes each side of every triangle that has been made so far, cuts it into thirds, then connects the 2 points in the middle of the line into an equilateral triangle and divides the length by 3, repeating for as many times as you want without crashing your computer.
I started by making 2 projects of simple drawings to learn some of the functions of the blot library. I then looked for some medium-difficulty fractals to make and found the Koch snowflake. I tried multiple ideas on how to get the fractal to generate, but after researching more I found that recursive functions work best for this by pretty much precalculating the drawing instead of fully drawing each triangle and saving the position on the way. This should be drawable on the blot as long as there aren't too many iterations
I have not used turtles in a while and this was a fun project.