this post was submitted on 20 Jun 2025
11 points (76.2% liked)
Technology
71997 readers
4173 users here now
This is a most excellent place for technology news and articles.
Our Rules
- Follow the lemmy.world rules.
- Only tech related news or articles.
- Be excellent to each other!
- Mod approved content bots can post up to 10 articles per day.
- Threads asking for personal tech support may be deleted.
- Politics threads may be removed.
- No memes allowed as posts, OK to post as comments.
- Only approved bots from the list below, this includes using AI responses and summaries. To ask if your bot can be added please contact a mod.
- Check for duplicates before posting, duplicates may be removed
- Accounts 7 days and younger will have their posts automatically removed.
Approved Bots
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
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!