The Terdragon Curve: The Elegant Three-Headed Fractal
The Terdragon Curve is a classic, self-similar fractal curve first studied and popularized by the pioneer of fractal geometry, Benoit Mandelbrot. While the traditional Harter-Heighway dragon curve folds in two directions, the Terdragon folds in three, producing a striking, triple-lobed point-symmetric boundary that resembles a three-headed dragon.
L-System Construction and Rules
The Terdragon curve is defined using a simple Lindenmayer system (L-system) grammar. At each recursive step, every straight line segment (represented by the variable $F$) is replaced by three smaller segments forming a zig-zag:
• Axiom (Initial Shape): $F$
• Rewriting Rule: $F \to F + F - F$
• Turn Angle: $120^\circ$ (or $\frac{2\pi}{3}$ radians)
Here, the symbol $+$ indicates turning left by $120^\circ$, and $-$ indicates turning right by $120^\circ$. By recursively applying this rule, the curve gains intricate detail:
- Iteration 0: $F$ (a single flat line segment)
- Iteration 1: $F + F - F$ (three segments with a peak)
- Iteration 2: $F+F-F + F+F-F - F+F-F$ (nine segments, and so on)
Scaling Factor and Fractal Dimension
As the order of the curve increases, the length of each segment is scaled down by a factor of $1 / \sqrt{3}$ relative to the previous step.
Mathematically, the number of segments grows as $3^n$ for recursion order $n$:
The Hausdorff dimension of the Terdragon curve is exactly $2$, meaning that like the Heighway dragon, it completely fills a portion of the two-dimensional plane in the infinite limit. However, the Hausdorff dimension of its boundary (its wiggly outer border) is:
Frequently Asked Questions
Frequently Asked Questions
What makes the Terdragon curve unique?
While standard dragon curves split a segment into two halves at $90^\circ$ angles, the Terdragon splits each segment into three sections at $120^\circ$ angles. This creates a triple-symmetric, clover-like appearance rather than the traditional spiral boundary.
How fast does the Terdragon curve grow?
It grows extremely fast! The segment count increases by a factor of 3 at every iteration. For example, order 1 has 3 segments, order 6 has 729 segments, and order 9 has 19,683 segments. Because of this exponential growth, iterations above 9 are capped to ensure your browser remains fast and responsive.
Does the Terdragon curve overlap itself?
No. Just like other dragon fractals, the Terdragon curve is self-avoiding and never intersects or crosses its own path, even as it becomes infinitely complex and winds extremely tightly.
Who discovered the Terdragon curve?
It was first identified and cataloged by Benoit Mandelbrot in his seminal 1982 book The Fractal Geometry of Nature as an example of an L-system curve with $120^\circ$ angular subdivisions.
