IFS Iterated Function Systems

Explore the generative art of self-similar fractals using chaos game and deterministic iteration methods

Rendered Points: 0 Active Transform: - FPS: 0 Fractal Dimension: -

Educational Content

Chaos Game

Start from any point and randomly select a transformation rule to apply each time. After thousands of repetitions, the point cloud gradually forms the fractal attractor. This method demonstrates how randomness produces deterministic patterns.

Deterministic Iteration

Start from an initial geometric shape and apply all transformation rules to all points simultaneously. Each iteration generates a new set of points, showing the hierarchical construction and self-similarity of the fractal.

Contraction Mapping Principle

Each transform is a distance contraction: d(T(x), T(y)) ≤ r·d(x, y) where r < 1. According to the collage theorem, the unique attractor satisfies self-similarity.

Fractal Dimension

For self-similar fractals: D = log(N) / log(1/r), where N is the number of similar copies and r is the scaling factor. For example, the Sierpinski triangle has a dimension of approximately 1.585.

Classic Fractal Examples

  • Sierpinski Triangle: 3 transforms, scale 1/2 each, dimension ≈ 1.585
  • Koch Curve: 4 transforms, scale 1/3 each, dimension ≈ 1.262
  • Dragon Curve: 2 transforms, scale 1/√2, dimension = 2
  • Barnsley Fern: 4 transforms, varying probabilities and scales, dimension ≈ 1.88