Fractal Geometry

Sierpinski, Koch, Menger - constructing infinite detail

Classic Fractals: Simple Rules, Infinite Detail

Take a shape, apply one rule, and repeat forever. You get objects with infinite length in a finite space, or infinite surface and no volume at all.

Sierpiński Triangle

Raise the recursion depth to keep cutting out middle triangles. Then switch to "Chaos Game": random jumps halfway toward a corner build the same triangle.

Each triangle is divided into 3 smaller triangles. The fractal dimension is log(3)/log(2) ≈ 1.585.

Go deeper:Classic Fractals: Simple Rules, Infinite Detail

The fractals on this page are constructed by simple geometric rules applied recursively. Each iteration adds more detail, and in the limit, they possess properties that seem paradoxical: infinite length in finite space, or infinite surface with zero volume.

These objects challenged mathematicians' understanding of dimension, measurement, and continuity - they were once called "mathematical monsters" before Mandelbrot showed they were everywhere in nature.

Go deeper:Sierpiński Triangle

Start with a triangle. Remove the middle. Repeat for each remaining triangle, forever. The result has zero area but infinite boundary. Remarkably, you can also create it with the "Chaos Game".

Koch Snowflake

Slide the iterations up and watch every edge sprout a bump. Notice the perimeter keeps growing while the area barely changes.

The Koch snowflake has infinite perimeter but finite area. Each iteration replaces every segment with 4 segments 1/3 the length - the perimeter grows by 4/3 each time!

Go deeper:Koch Snowflake

Each side of a triangle is replaced with a bump, then each new segment gets a bump, forever. The perimeter grows without bound while the area converges to a finite value.

Dragon Curve

Raise the iterations to fold the paper strip again and again. The curve never crosses itself, yet it fills in a solid region.

The Dragon Curve can be made by folding a strip of paper in half repeatedly, then unfolding at 90° angles. It tiles the plane and has fractal dimension 2!

Go deeper:Dragon Curve

Fold a strip of paper in half repeatedly, then unfold at right angles. The resulting curve never crosses itself and eventually fills a region of the plane completely (dimension 2).

Go deeper:Fractal Dimension

The fractal dimension measures how a shape fills space. For self-similar fractals, we can calculate it:

D = log(N) / log(S)

Where N = number of copies and S = scale factor.

  • Sierpiński: D = log(3)/log(2) ≈ 1.585
  • Koch: D = log(4)/log(3) ≈ 1.262
  • Dragon: D = 2 (space-filling)
  • Menger: D = log(20)/log(3) ≈ 2.727

Menger Sponge

Drag to rotate and scroll to zoom, then raise the iterations to punch out more cubes. Each step removes 7 of every 27 cubes.

Go deeper:Menger Sponge

The 3D analog of the Sierpiński carpet. Divide a cube into 27 smaller cubes, remove the center and face centers (7 cubes), repeat. The limiting object has infinite surface area but zero volume.

Go deeper:Comparing Classic Fractals
FractalDimensionArea/VolumePerimeter/Surface
Sierpiński~1.5850∞
Koch~1.262Finite∞
Dragon2Finite (fills)∞
Menger~2.7270∞
Go deeper:Beyond Mathematical Curiosity

These "monsters" turn out to be everywhere:

  • Antennas: Fractal antennas (like the Sierpiński) can receive multiple frequencies due to their self-similarity.
  • Lungs: The bronchial tree has fractal branching, maximizing surface area for gas exchange.
  • Computer Graphics: Fractal algorithms generate realistic mountains, clouds, and plants.
  • Data Compression: Fractal image compression exploits self-similarity in photographs.

Spot a mistake or have an idea?

Search