Draw any shape, see the circles that draw it for you.
The Fourier transform is usually introduced as an integral and met with apprehension. Here it is a chain of rotating arrows. Sketch a closed shape with your finger or mouse, and watch a tower of nested circles retrace it — perfectly when you allow enough of them, cartoonishly when you don’t. Or hum into the microphone and see your voice as the same kind of stack, only made of audible frequencies instead of geometric ones.
Reading the picture
§ 04 · NotesShow the math
Sample a closed curve at N equally-spaced points along its arc length. Treat each sample as a complex number zk = xk + i·yk. The discrete Fourier transform decomposes that sequence into coefficients that label rotating arrows.
Each coefficient cn describes one arrow. Its length |cn| is the radius of that arrow’s circle; its angle arg(cn) is where the arrow points at time zero; the integer n is how many full revolutions per period it makes. Positive n turn one way; negative n turn the other.
Sort the coefficients by magnitude and keep only the top K. Stack them tip-to-tail and let t advance. The final tip retraces the original curve — exactly when K = N, and progressively more cartoonishly as K shrinks.
For the audio mode, the sampled signal is real (just amplitude over time) and the visualisation shows |cn| against frequency, which is exactly what your eardrum already does: the cochlea is a biological spectrum analyser.
Fourier’s 1822 theorem was so unbelievable to his contemporaries that the prize committee refused to print it for fifteen years.