Dragon curve

Last updated

Heighway dragon curve Fractal dragon curve.jpg
Heighway 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. 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.

Contents

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 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 . [1]

Construction

Recursive construction of the curve Dragon Curve unfolding zoom numbered.gif
Recursive construction of the curve
Recursive construction of the curve Dragon Curve adding corners trails rectangular numbered R.gif
Recursive construction of the curve

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: [2]

The first 5 iterations and the 9th Dragon curve iterations (2).svg
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:

with the initial set of points .

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

Folding the dragon

The Heighway dragon curve can be constructed by folding a strip of paper, which is how it was originally discovered. [1] 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).

Dragon curve paper strip.png

The folding patterns of this sequence of paper strips, as sequences of right (R) and left (L) folds, are:

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. [1]

Properties

Dimensions fractale dragon.png
Lengths
Auto-similarity dragon curve.png
Self-similarities
Tiling of the plane by dragon curves Full tiling dragon.svg
Tiling of the plane by dragon curves

Twindragon

Twindragon curve constructed from two Heighway dragons Twindragon.png
Twindragon curve constructed from two Heighway dragons

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:

where the initial shape is defined by the following set .

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

It is also the locus of points in the complex plane with the same integer part when written in base . [5]

Terdragon

Terdragon curve. Terdragon.png
Terdragon curve.
A sculpture depicting multiple iterations of the Lindenmayer system that generates the terdragon curve.
by Henry Segerman Developing Terdragon Curve.jpg
A sculpture depicting multiple iterations of the Lindenmayer system that generates the terdragon curve.
by Henry Segerman

The terdragon can be written as a Lindenmayer system:

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

Lévy dragon

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

Levy C curve. Levy's C-curve (IFS).jpg
Lévy C curve.

Variants

Unicorn Curve Unicorn Dragon Curve.jpg
Unicorn Curve
Lion Curve Lion Dragon Curve.png
Lion Curve


The dragon curve belongs to a basic set of iteration functions consisting of two lines with four possible orientations at perpendicular angles:

CurveCreators and Creation Year of Dragon Family Members
Lévy Curve Ernesto Cesàro (1906), Georg Faber (1910), Paul Lévy (1914)
Dragon curveJohn Heighway (1966), Bruce Banks (1966), William Harter (1966)
Davis Diamond Chandler Davis (1970), Donald J. Knuth (1970)
Knuth Wedge Chandler Davis (1970), Donald J. Knuth (1970)
Unicorn Curve Peter van Roy (1989)
Lion Curve Bernt Rainer Wahl (1989)

It is possible to change the turn angle from 90° to other angles. Changing to 120° yields a structure of triangles, while 60° gives the following curve:

The dragon curve, 60deg variant. Self-similarity is clearly visible. Dragon60.png
The dragon curve, 60° variant. Self-similarity is clearly visible.

A discrete dragon curve can be converted to a dragon polyomino as shown. Like discrete dragon curves, dragon polyominoes approach the fractal dragon curve as a limit.

A Dragon Polyomino Dragomino-5.svg
A Dragon Polyomino

Occurrences of the dragon curve in solution sets

Having obtained the set of solutions to a linear 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: where all .

For some we define the following functions:

Starting at z=0 we can generate all Littlewood polynomials of degree d using these functions iteratively d+1 times. [7] For instance:

It can be seen that for , 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 . 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. [7] [8] [9]

See also

Related Research Articles

<span class="mw-page-title-main">Elliptic curve</span> Algebraic curve

In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point O. An elliptic curve is defined over a field K and describes points in K2, the Cartesian product of K with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions (x, y) for:

<span class="mw-page-title-main">Special unitary group</span> Group of unitary matrices with determinant of 1

In mathematics, the special unitary group of degree n, denoted SU(n), is the Lie group of n × n unitary matrices with determinant 1.

<span class="mw-page-title-main">Spherical harmonics</span> Special mathematical functions defined on the surface of a sphere

In mathematics and physical science, spherical harmonics are special functions defined on the surface of a sphere. They are often employed in solving partial differential equations in many scientific fields. A list of the spherical harmonics is available in Table of spherical harmonics.

In mathematics, a Gaussian function, often simply referred to as a Gaussian, is a function of the base form

In geometry and complex analysis, a Möbius transformation of the complex plane is a rational function of the form

<span class="mw-page-title-main">Modular group</span> Orientation-preserving mapping class group of the torus

In mathematics, the modular group is the projective special linear group of 2 × 2 matrices with integer coefficients and determinant 1. The matrices A and A are identified. The modular group acts on the upper-half of the complex plane by fractional linear transformations, and the name "modular group" comes from the relation to moduli spaces and not from modular arithmetic.

In geodesy, conversion among different geographic coordinate systems is made necessary by the different geographic coordinate systems in use across the world and over time. Coordinate conversion is composed of a number of different types of conversion: format change of geographic coordinates, conversion of coordinate systems, or transformation to different geodetic datums. Geographic coordinate conversion has applications in cartography, surveying, navigation and geographic information systems.

In mathematics, the Schwarzian derivative is an operator similar to the derivative which is invariant under Möbius transformations. Thus, it occurs in the theory of the complex projective line, and in particular, in the theory of modular forms and hypergeometric functions. It plays an important role in the theory of univalent functions, conformal mapping and Teichmüller spaces. It is named after the German mathematician Hermann Schwarz.

In mathematics, the polar decomposition of a square real or complex matrix is a factorization of the form , where is a unitary matrix and is a positive semi-definite Hermitian matrix, both square and of the same size.

In mathematics, a volume element provides a means for integrating a function with respect to volume in various coordinate systems such as spherical coordinates and cylindrical coordinates. Thus a volume element is an expression of the form

In mathematics, a logarithm of a matrix is another matrix such that the matrix exponential of the latter matrix equals the original matrix. It is thus a generalization of the scalar logarithm and in some sense an inverse function of the matrix exponential. Not all matrices have a logarithm and those matrices that do have a logarithm may have more than one logarithm. The study of logarithms of matrices leads to Lie theory since when a matrix has a logarithm then it is in an element of a Lie group and the logarithm is the corresponding element of the vector space of the Lie algebra.

<span class="mw-page-title-main">Complex torus</span>

In mathematics, a complex torus is a particular kind of complex manifold M whose underlying smooth manifold is a torus in the usual sense. Here N must be the even number 2n, where n is the complex dimension of M.

In mathematics, a de Rham curve is a continuous fractal curve obtained as the image of the Cantor space, or, equivalently, from the base-two expansion of the real numbers in the unit interval. Many well-known fractal curves, including the Cantor function, Cesàro–Faber curve, Minkowski's question mark function, blancmange curve, and the Koch curve are all examples of de Rham curves. The general form of the curve was first described by Georges de Rham in 1957.

In special functions, a topic in mathematics, spin-weighted spherical harmonics are generalizations of the standard spherical harmonics and—like the usual spherical harmonics—are functions on the sphere. Unlike ordinary spherical harmonics, the spin-weighted harmonics are U(1) gauge fields rather than scalar fields: mathematically, they take values in a complex line bundle. The spin-weighted harmonics are organized by degree l, just like ordinary spherical harmonics, but have an additional spin weights that reflects the additional U(1) symmetry. A special basis of harmonics can be derived from the Laplace spherical harmonics Ylm, and are typically denoted by sYlm, where l and m are the usual parameters familiar from the standard Laplace spherical harmonics. In this special basis, the spin-weighted spherical harmonics appear as actual functions, because the choice of a polar axis fixes the U(1) gauge ambiguity. The spin-weighted spherical harmonics can be obtained from the standard spherical harmonics by application of spin raising and lowering operators. In particular, the spin-weighted spherical harmonics of spin weight s = 0 are simply the standard spherical harmonics:

In physics and mathematics, the solid harmonics are solutions of the Laplace equation in spherical polar coordinates, assumed to be (smooth) functions . There are two kinds: the regular solid harmonics, which are well-defined at the origin and the irregular solid harmonics, which are singular at the origin. Both sets of functions play an important role in potential theory, and are obtained by rescaling spherical harmonics appropriately:

In the Standard Model, using quantum field theory it is conventional to use the helicity basis to simplify calculations. In this basis, the spin is quantized along the axis in the direction of motion of the particle.

<span class="mw-page-title-main">Conway–Maxwell–Poisson distribution</span> Probability distribution

In probability theory and statistics, the Conway–Maxwell–Poisson distribution is a discrete probability distribution named after Richard W. Conway, William L. Maxwell, and Siméon Denis Poisson that generalizes the Poisson distribution by adding a parameter to model overdispersion and underdispersion. It is a member of the exponential family, has the Poisson distribution and geometric distribution as special cases and the Bernoulli distribution as a limiting case.

In mathematics, the spectral theory of ordinary differential equations is the part of spectral theory concerned with the determination of the spectrum and eigenfunction expansion associated with a linear ordinary differential equation. In his dissertation, Hermann Weyl generalized the classical Sturm–Liouville theory on a finite closed interval to second order differential operators with singularities at the endpoints of the interval, possibly semi-infinite or infinite. Unlike the classical case, the spectrum may no longer consist of just a countable set of eigenvalues, but may also contain a continuous part. In this case the eigenfunction expansion involves an integral over the continuous part with respect to a spectral measure, given by the Titchmarsh–Kodaira formula. The theory was put in its final simplified form for singular differential equations of even degree by Kodaira and others, using von Neumann's spectral theorem. It has had important applications in quantum mechanics, operator theory and harmonic analysis on semisimple Lie groups.

In mathematics, infinite compositions of analytic functions (ICAF) offer alternative formulations of analytic continued fractions, series, products and other infinite expansions, and the theory evolving from such compositions may shed light on the convergence/divergence of these expansions. Some functions can actually be expanded directly as infinite compositions. In addition, it is possible to use ICAF to evaluate solutions of fixed point equations involving infinite expansions. Complex dynamics offers another venue for iteration of systems of functions rather than a single function. For infinite compositions of a single function see Iterated function. For compositions of a finite number of functions, useful in fractal theory, see Iterated function system.

In mathematics, a linear recurrence with constant coefficients sets equal to 0 a polynomial that is linear in the various iterates of a variable—that is, in the values of the elements of a sequence. The polynomial's linearity means that each of its terms has degree 0 or 1. A linear recurrence denotes the evolution of some variable over time, with the current time period or discrete moment in time denoted as t, one period earlier denoted as t − 1, one period later as t + 1, etc.

References

  1. 1 2 3 4 Tabachnikov, Sergei (2014), "Dragon curves revisited", The Mathematical Intelligencer, 36 (1): 13–17, doi:10.1007/s00283-013-9428-y, MR   3166985, S2CID   14420269
  2. Edgar, Gerald (2008), "Heighway's Dragon", in Edgar, Gerald (ed.), Measure, Topology, and Fractal Geometry, Undergraduate Texts in Mathematics (2nd ed.), New York: Springer, pp. 20–22, doi:10.1007/978-0-387-74749-1, ISBN   978-0-387-74748-4, MR   2356043
  3. Edgar (2008), "Heighway’s Dragon Tiles the Plane", pp. 74–75.
  4. Edgar (2008), "Heighway Dragon Boundary", pp. 194–195.
  5. Knuth, Donald (1998). "Positional Number Systems". The art of computer programming. Vol. 2 (3rd ed.). Boston: Addison-Wesley. p. 206. ISBN   0-201-89684-2. OCLC   48246681.
  6. 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, JSTOR   3072395, MR   1927621 .
  7. 1 2 "The n-Category Café".
  8. "Week285".
  9. "The Beauty of Roots". 2011-12-11.