How To Draw Einstein's Face Parametrically

### New Book Reviews!

 How To Draw Einstein's Face Parametrically
Written by Mike James
Wednesday, 10 April 2013
Article Index
How To Draw Einstein's Face Parametrically
Initial Steps
Mathematica Makes It Easy
A Feat in Python

No doubt if you spend a lot of time on the problem you will eventually pick up some intuitions into how to create shapes of particular types. Eventually you could put together a toolkit of shapes that you could use to make other shapes - but this doesn't sound like a good way to spend your creative talent.

The easy way to do the job is to start of with a digitization of the curve you want to create. You can obtain this by manually measuring a photo using Photoshop or Gimp or you could use a filter that automatically converts the grey scale photo to a line drawing. Alternatively if you really do have some artistic talent you could actually sketch the line drawing you want to turn into a parametric curve.

As I don't have any talent, I'm going to use a crude digitization of an eye shape to show you how things work. I'm also not going to cover how to use or create a line filter.

`x=[0,1,4,6,8,10,8,6,4,1,0]y=[0,2,3,3,2,0,-2,-3,-3,-2,0]plt.plot(x, y)plt.show()`

## Using  Discrete Fourier Transform

Our next problem is to convert the coordinate sequence into a parametric function that generates the same sequence. The simplest way of doing this is to use the Discrete Fourier Transform function that Mathematica and PySci provide to fit trigonometric series to the data.

If you don't already know about Fourier series don't panic at the next section simply accept the formulae and follow the general reasoning - and then realize why you really do need to study some math!

This part of the explanation is complicated because the DFT is complex - i.e. written in the form of a series using complex numbers. In Mathematica the function Fourier[list] converts the list of values into a list of the same length of complex numbers. The formula for the conversion is:

where u is the list of data points and f is the list of complex amplitudes for each frequency.  The important part of the DFT is that you can go back from the amplitudes to the data using the inverse DFT:

The important part is that we can obtain f from the Fourier function and by putting those values into the inverse formula we can get the original u values.

So what?

This seems like going round in circles which it sort of is in an obscure mathematical way - but the whole point is that the inverse DFT formula is hiding the fact that it can be turned into the trigonometric series we are looking for.

As long as the series u is composed of real numbers then half of the DFT coefficients are redundant as for s>0

Where * means complex conjugate. In other words the second half of the list of numbers is just the complex conjugate of the first half and this means we don't need them. More importantly it means that the complex exponentials can be reduced to cos by merging pairs of terms.

The details aren't difficult but the algebra is long and not really relevant to the discussion. The final result is:

Where A is the magnitude of f and phi is the phase angle.

As the examples quoted in Wolfram Alpha use sin rather than cos we can use the usual relationship between Sin and Cos to get:

You can write the formula so the first term looks like the rest but be warned this can can produce problems when you try to find the phase of the first term if it zero - i.e. if the original series has mean zero.

## Implementation in Mathematica

Now we can implement the technique in Mathematica. The data can be the x co-ordinates from the "eye" plot:

`x = {0, 1, 4, 6, 8, 10, 8, 6, 4, 1, 0};`

Getting the Fourier coefficients, the f values, is easy:

`f = Fourier[x]`

and we only need the first half of the result and we need to remove the first term:

`hn = Ceiling[n/2]; A0 = First[f]; f = Take[f, {2, hn}];`

Now we can compute the magnitudes and the phase angles:

`A = Abs[f];p = Arg[f];`

Putting all of this together we can now create a function that computes the original data using the previous formula for the sin series:

`xp[t_] := A0/Sqrt[n] +2/Sqrt[n]*    Total[A*Sin[Pi/2 -      2*Pi/n*Range[1, hn - 1]*t + P]]]]`

Now we have the function that approximates the original data. If you want to try it out you can evaluate xp[0], xp[1] and so on and discover that they are close to x[0], x[1] and so on. If you plot the function:

`ParametricPlot[{t, xp[t]}, {t, 0, n - 1}]`

You might be surprised to find that the shape isn't exactly close to the original:

The point is that the approximation is only guaranteed to hold a the data points - between the data the series wiggles as a trigonometric series does.

Last Updated ( Wednesday, 10 April 2013 )