b2KIT

Fractal Generator

Generate Koch snowflake, Sierpinski triangle, dragon curve, and custom IFS fractals with adjustable iteration depth and coloring.

Tested tool guide Tested browser tools Checked August 16, 2026

What Fractal Generator does and how it behaves

Choose the Koch snowflake, Sierpinski triangle, dragon curve, or a custom iterated function system, then adjust the iteration depth and coloring to generate a fractal image. Each preset defines a particular geometric recursion, while a custom IFS describes repeated transformations of an initial set. The important surprise is that iteration depth is not a linear detail control: every additional step multiplies the number of geometric pieces, so a small increase can make the drawing substantially denser without making it an exact infinite fractal.

How the result is produced

1

Preset recursion

Each named preset follows its own replacement rule. One Koch refinement replaces every segment with four shorter segments. A Sierpinski refinement retains three half-scale corner triangles, while a dragon-curve refinement doubles the segment count through its folding pattern. Repeating the selected rule produces a finite approximation of the corresponding limiting shape.

2

Custom IFS and color

A custom iterated function system represents a set through a family of transformations whose repeated images form a self-similar result. Contractive transformations are the usual choice because they converge toward a bounded attractor. Coloring changes how iterations, pieces, or regions are distinguished in the rendered image; it does not change the underlying geometric recursion.

Good uses

  • Compare how the Koch snowflake, Sierpinski triangle, and dragon curve develop over successive iteration depths for a lesson on recursion and self-similarity.
  • Preview whether a proposed custom IFS produces a bounded, recognizable attractor before using its transformation values in a larger mathematical or graphics project.
  • Generate visual variations of one fractal at several depths and color settings for diagrams, demonstrations, or exploratory geometric artwork.

Limits and checks

  • The generated picture is a finite approximation. Increasing depth adds detail, but no finite setting contains the infinitely many features of the mathematical limit.
  • Depth numbering can be misread because the seed may be described as iteration zero in one convention and the first stage in another. Compare adjacent displayed depths instead of assuming a stage number.
  • A custom IFS is sensitive to its transformations. Expanding or poorly positioned maps may have no bounded attractor, may overlap heavily, or may place important parts outside the useful viewing region.

Common questions

Does a higher iteration depth make the fractal mathematically exact?

No. Every displayed result has a finite number of segments, triangles, or transformed copies. A greater depth can resemble the limiting fractal more closely at the available display scale, but it remains an approximation. Past some depth, newly generated features may also be smaller than individual screen pixels and therefore cease to add visible information.

Will any set of custom IFS transformations produce a recognizable fractal?

No. A stable bounded attractor is normally associated with a finite family of contractive transformations. Transformations that expand distances or send copies far apart need not settle into a bounded figure. Heavy overlap can also produce a solid-looking region rather than visibly separated self-similar pieces, even when the system is mathematically well defined.

References and verification

The behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.

Related Tools