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.
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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. The dragon curve is probably most commonly thought of as the shape that is generated from repeatedly folding a strip of paper in half, although there are other curves that are called dragon curves that are generated differently. 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} The boundary of the set covered by the dragon curve has infinite length, with fractal dimension 2\log_2\lambda\approx 1.523627086202492, where \lambda=\frac{1+(28-3\sqrt{87})^{1/3}+(28+3\sqrt{87})^{1/3}}{3}\approx 1.69562076956 is the real solution of the equation \lambda^3-\lambda^2-2=0. 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 the initial string: angle 90° initial string FX+FX+ string rewriting rules X X+YF Y FX−Y. It is also the locus of points in the complex plane with the same integer part when written in base (-1 \pm i) . 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}}.
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| 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.
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. Knuth on the Dragon Curve Dragon Curve
Text derived from https://en.wikipedia.org/w/index.php?oldid=1342624560 under CC BY-SA 4.0; modifications have been made.