I’m disappointed that none of them seem to have gone with the random convergence approach.
Set the three corners of an equilateral triangle. Pick a random starting point on the canvas. Every iteration, pick a random corner from the triangle and your next point is the midpoint between the current point and that corner. While the original point is almost guaranteed not to be a point in Sierpinski’s triangle, each iteration cuts the distance between the new point and the nearest Sierpinski point in half.
If you start plotting points starting with (say) the 50th one, every pixel is “close enough” to a Sierpinski point that you see the triangle materialize out of nothing. The whole thing could be programmed in about 20 lines of QBasic on DOS 30 years ago.
threaded - newest
I’m disappointed that none of them seem to have gone with the random convergence approach.
Set the three corners of an equilateral triangle. Pick a random starting point on the canvas. Every iteration, pick a random corner from the triangle and your next point is the midpoint between the current point and that corner. While the original point is almost guaranteed not to be a point in Sierpinski’s triangle, each iteration cuts the distance between the new point and the nearest Sierpinski point in half.
If you start plotting points starting with (say) the 50th one, every pixel is “close enough” to a Sierpinski point that you see the triangle materialize out of nothing. The whole thing could be programmed in about 20 lines of QBasic on DOS 30 years ago.
Oh, maybe! I didn’t understand how it chose the points, but it does look like the random convergence approach.
Nice, thanks!
Here’s a cool video about it
yewtu.be/watch?v=kbKtFN71Lfs
Edit:
Meant to reply to msfroh, oops
It’s not pretty, but you can print one in a single line of python:
print(*[“”.join(" " if i & j else “MM” for j in range(64)) for i in range(64)], sep=“\n”)oh, wow! that’s so cool!