Dragon curve

A dragon curve is any member of a family of self-similar fractal curves, which can be approximated by recursive methods such as Lindenmayer systems.

Heighway dragon

Heighway dragon curve

The Heighway dragon (also known as the Harter–Heighway dragon or the Jurassic Park dragon) was first investigated by NASA physicists John Heighway, Bruce Banks, and William Harter. It was described by Martin Gardner in his Scientific American column Mathematical Games in 1967. Many of its properties were first published by Chandler Davis and Donald Knuth. It appeared on the section title pages of the Michael Crichton novel Jurassic Park.

Construction

It can be written as a Lindenmayer system with

That can be described this way : Starting from a base segment, replace each segment by 2 segments with a right angle and with a rotation of 45° alternatively to the right and to the left:

The Heighway dragon is also the limit set of the following iterated function system in the complex plane:

f_1(z)=\frac{(1+i)z}{2}
f_2(z)=1-\frac{(1-i)z}{2}

with the initial set of points S_0=\{0,1\}.

Using pairs of real numbers instead, this is the same as the two functions consisting of

f_1(x,y)= \frac{1}{\sqrt{2}}\begin{pmatrix} \cos 45^\circ & -\sin 45^\circ \\ \sin 45^\circ & \cos 45^\circ \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix}
f_2(x,y)= \frac{1}{\sqrt{2}}\begin{pmatrix} \cos 135^\circ & -\sin 135^\circ \\ \sin 135^\circ & \cos 135^\circ \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} + \begin{pmatrix} 1 \\ 0 \end{pmatrix}

This representation is more commonly used in software such as Apophysis.

The path of the curve can be more easily seen with each turn curved

[Un]Folding the Dragon

Tracing an iteration of the Heighway dragon curve from one end to the other, one encounters a series of 90 degree turns, some to the right and some to the left. For the first few iterations the sequence of right (R) and left (L) turns is as follows:

1st iteration: R
2nd iteration: R R L
3rd iteration: R R L R R L L
4th iteration: R R L R R L L R R R L L R L L.

This suggests the following pattern: each iteration is formed by taking the previous iteration, adding an R at the end, and then taking the original iteration again, flipping it retrograde, swapping each letter and adding the result after the R.

This pattern in turn suggests the following method of creating models of iterations of the Heighway dragon curve by folding a strip of paper. Take a strip of paper and fold it in half to the right. Fold it in half again to the right. If the strip was opened out now, unbending each fold to become a 90 degree turn, the turn sequence would be RRL i.e. the second iteration of the Heighway dragon. Fold the strip in half again to the right, and the turn sequence of the unfolded strip is now RRLRRLL – the third iteration of the Heighway dragon. Continuing folding the strip in half to the right to create further iterations of the Heighway dragon (in practice, the strip becomes too thick to fold sharply after four or five iterations).

This pattern also gives a method for determining the direction of the nth turn in the turn sequence of a Heighway dragon iteration. First, express n in the form k2m where k is an odd number. The direction of the nth turn is determined by k mod 4 i.e. the remainder left when k is divided by 4. If k mod 4 is 1 then the nth turn is R; if k mod 4 is 3 then the nth turn is L.

For example, to determine the direction of turn 76376:

76376 = 9547 x 8.
9547 = 2386x4 + 3
so 9547 mod 4 = 3
so turn 76376 is L

There is a simple one line non-recursive method of implementing the above k mod 4 method of finding the turn direction in code. Treating turn n as a binary number, calculate the following boolean value:

bool turn = (((n & −n) << 1) & n) != 0;

Gray code method

Another way of handling this is a reduction for the above algorithm. Using Gray code, starting from zero, determine the change to the next value. If the change is a 1 turn left, and if it is 0 turn right. Given a binary input, B, the corresponding gray code, G, is given by "G = B XOR (B>>1)". Using Gi and Gi−1, turn equals" (not Gi) AND Gi−1".

Dimensions

In fact it can be found analytically:[2] \log_2\left(\frac{1+\sqrt[3]{73-6\sqrt{87}}+\sqrt[3]{73+6\sqrt{87}}}{3}\right)\cong 1.523627086202492. This is the root of the equation \textstyle{4^x(2^x-1)=4(2^x+1).}

Tiling

The dragon curve can tile the plane in many ways.

Twindragon

The twindragon (also known as the Davis-Knuth dragon) can be constructed by placing two Heighway dragon curves back-to-back. It is also the limit set of the following iterated function system:

f_1(z)=\frac{(1+i)z}{2}
f_2(z)=1-\frac{(1+i)z}{2}

where the initial shape is defined by the following set S_0 = \{0,1,1-i\}.

It can be also written as a Lindenmayer system – it only needs adding another section in initial string:

Twindragon curve.
Twindragon curve constructed from two Heighway dragons.

Terdragon

Terdragon curve.

The terdragon can be written as a Lindenmayer system:

It is the limit set of the following iterated function system:

f_1(z)=\lambda z
f_2(z)=\frac{i}{\sqrt{3}}z + \lambda
f_3(z)=\lambda z + \lambda^*
\mbox{where }\lambda=\frac{1}{2}-\frac{i}{2\sqrt{3}} \text{ and }\lambda^*=\frac{1}{2}+\frac{i}{2\sqrt{3}}.

Lévy dragon

The Lévy C curve is sometimes known as the Lévy dragon.[3]

Lévy C curve.

Occurrences of the dragon curve in solution sets

Having obtained the set of solutions to a differential equation, any linear combination of the solutions will, because of the superposition principle, also obey the original equation. In other words, new solutions are obtained by applying a function to the set of existing solutions. This is similar to how an iterated function system produces new points in a set, though not all IFS are linear functions. In a conceptually similar vein, a set of Littlewood polynomials can be arrived at by such iterated applications of a set of functions.

A Littlewood polynomial is a polynomial: p(x) = \sum_{i=0}^n a_i x^i \, where all a_i = \pm 1.

For some |w| < 1 we define the following functions:

f_+(z) = 1 + wz
f_-(z) = 1 - wz

Starting at z=0 we can generate all Littlewood polynomials of degree d using these functions iteratively d+1 times.[4] For instance: f_+(f_-(f_-(0))) = 1 + (1-w)w = 1 + 1w - 1w^2

It can be seen that for w = (1+i)/2, the above pair of functions is equivalent to the IFS formulation of the Heighway dragon. That is, the Heighway dragon, iterated to a certain iteration, describe the set of all Littlewood polynomials up to a certain degree, evaluated at the point w = (1+i)/2. Indeed, when plotting a sufficiently high number of roots of the Littlewood polynomials, structures similar to the dragon curve appear at points close to these coordinates.[4][5][6]

See also

Notes

  1. ↑ Fractal dimension of the boundary of the Dragon curve
  2. ↑ "The Boundary of Periodic Iterated Function Systems" by Jarek Duda, The Wolfram Demonstrations Project. Recurrent construction of the boundary of dragon curve.
  3. ↑ Bailey, Scott; Kim, Theodore; Strichartz, Robert S. (2002), "Inside the Lévy dragon", The American Mathematical Monthly 109 (8): 689–703, doi:10.2307/3072395, MR 1927621.
  4. 1 2 http://golem.ph.utexas.edu/category/2009/12/this_weeks_finds_in_mathematic_46.html
  5. ↑ http://math.ucr.edu/home/baez/week285.html
  6. ↑ http://johncarlosbaez.wordpress.com/2011/12/11/the-beauty-of-roots/

Further reading

External links

Wikimedia Commons has media related to Dragon curve.
This article is issued from Wikipedia - version of the Sunday, December 27, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.