Editing Dragon curve (section)

== Heighway dragon ==
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 (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 (novel)|Jurassic Park]]''.<ref name=tabachnikov>{{citation
 | last = Tabachnikov | first = Sergei
 | doi = 10.1007/s00283-013-9428-y
 | issue = 1
 | journal = The Mathematical Intelligencer
 | mr = 3166985
 | pages = 13–17
 | title = Dragon curves revisited
 | volume = 36
 | year = 2014| s2cid = 14420269
 }}</ref>

=== Construction ===
[[File:Dragon Curve unfolding zoom numbered.gif|300px|Recursive construction of the curve|alt=|thumb]]
[[File:Dragon Curve adding corners trails rectangular numbered R.gif|300px|Recursive construction of the curve|alt=|thumb]]
The Heighway dragon can be constructed from a base [[line segment]] by repeatedly replacing each segment by two segments with a right angle and with a rotation of 45° alternatively to the right and to the left:<ref>{{citation
 | last = Edgar | first = Gerald
 | editor1-first = Gerald
 | editor1-last = Edgar
 | contribution = Heighway's Dragon
 | doi = 10.1007/978-0-387-74749-1
 | edition = 2nd
 | isbn = 978-0-387-74748-4
 | mr = 2356043
 | pages = 20–22
 | publisher = Springer | location = New York
 | series = Undergraduate Texts in Mathematics
 | title = Measure, Topology, and Fractal Geometry
 | year = 2008}}</ref>
[[File:Dragon curve iterations (2).svg|none|700px|The first 5 iterations and the 9th]]

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

:<math>f_1(z)=\frac{(1+i)z}{2}</math>
:<math>f_2(z)=1-\frac{(1-i)z}{2}</math>

with the initial set of points <math>S_0=\{0,1\}</math>.

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

:<math>\begin{align}
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} \\[6px]
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}
\end{align}</math>

=== Folding the dragon ===
The Heighway dragon curve can be constructed by [[regular paperfolding sequence|folding a strip of paper]], which is how it was originally discovered.<ref name=tabachnikov/> 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).

[[File:Dragon curve paper strip.png|center|800px]]

The folding patterns of this sequence of paper strips, as sequences of right (R) and left (L) folds, are:
* 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'''.
Each iteration can be found by copying the previous iteration, then an R, then a second copy of the previous iteration in reverse order with the L and R letters swapped.<ref name=tabachnikov/>

=== Properties ===
* Many '''self-similarities''' can be seen in the Heighway dragon curve. The most obvious is the repetition of the same pattern tilted by 45° and with a reduction ratio of <math>\textstyle{\sqrt{2}}</math>. Based on these self-similarities, many of its lengths are simple rational numbers.
{{multiple image|total_width=800|align=center|image1=Dimensions fractale dragon.png|caption1=Lengths|image2=Auto-similarity dragon curve.png|caption2=Self-similarities}}
[[File:Full tiling dragon.svg|thumb|upright=1.35|Tiling of the plane by dragon curves]]
* The dragon curve can [[Tessellation|tile the plane]]. One possible tiling replaces each edge of a [[square tiling]] with a dragon curve, using the recursive definition of the dragon starting from a line segment. The initial direction to expand each segment can be determined from a checkerboard coloring of a square tiling, expanding vertical segments into black tiles and out of white tiles, and expanding horizontal segments into white tiles and out of black ones.<ref>{{harvtxt|Edgar|2008}}, "Heighway’s Dragon Tiles the Plane", pp. 74–75.</ref>
* As a [[space-filling curve]], the dragon curve has [[fractal dimension]] exactly 2. For a dragon curve with initial segment length 1, its area is 1/2, as can be seen from its tilings of the plane.<ref name=tabachnikov/>
* The boundary of the set covered by the dragon curve has infinite length, with fractal dimension <math display=block>2\log_2\lambda\approx 1.523627086202492,</math> where <math display=block>\lambda=\frac{1+\sqrt[3]{28-3\sqrt{87}}+\sqrt[3]{28+3\sqrt{87}}}{3}\approx 1.69562076956</math> is the real solution of the equation <math>\lambda^3-\lambda^2-2=0.</math><ref>{{harvtxt|Edgar|2008}}, "Heighway Dragon Boundary", pp. 194–195.</ref>