Hexagonal Cellular Automata Sierpinski's Triangle

May 3, 2018 1:51 PM

Keve1227

Views

10180

Likes

15

Dislikes

3

#cellular_automata #sierpinski_triangle #hexagons

cellular_automata

sierpinski_triangle

hexagons

Fractaly

7 years ago | Likes 1 Dislikes 0

F-f-f-FRRRAaaaaactals! Fractals!

7 years ago | Likes 1 Dislikes 0

laaame, your algorithm devolves into static, fun fact, easy algorithm for the maximum size sierpinski you can fit on a page is:

7 years ago | Likes 1 Dislikes 0

set the first pixel on, then for each pixel from top left if the pixel is black toggle the state of the pixel 1 to the right and 1 below

7 years ago | Likes 1 Dislikes 0

theres one i generated, but that was using a longer algorithm

7 years ago | Likes 1 Dislikes 0

Had the hexagonal plane been infinite, the fractal would have branched on forever. Of course, there's still nothing spectacular about it...

7 years ago | Likes 1 Dislikes 0

yeah, but how many passes do you need to generate the full triangle using that method, if we assume an infinite area to work with, the

7 years ago | Likes 1 Dislikes 0

method i mention would do it in a single(albeit infinite) pass

7 years ago | Likes 1 Dislikes 0

The algorithm you mentioned does it in as many passes as there are rows in the final image.

7 years ago | Likes 1 Dislikes 0

Mine also does it in a single infinite pass, though in the dimension of time.

7 years ago | Likes 1 Dislikes 0

so in the gif you appear to be iterating through the entire image multiple times to generate the triangle

7 years ago | Likes 1 Dislikes 0