ON THE GENERATION AND USE OF SPACE-FILLING CURVES
Abstract
A recent note describes elegant algorithms for drawing
certain space-filling curves. These seem to be an improvement upon recursive
algorithms described earlier, which are in turn a very considerable
improvement on non-recursive algorithms for the same problem. This
note points out that such elegant algorithms have been known for some
time; indeed they form the basis of a series of experimental graphics
languages which have been designed expressly to permit artists to create beautiful
and intricate pictures without resorting to tedious specification of
each individual picture element. Moreover, contrary to popular belief,
recursive space-filling curves have applications apart from producing pretty
pictures: we briefly describe one of these and point out an intriguing similarity
between the two-dimensional fast Fourier transform decomposition of a
plane and the order of points visited by a Peano curve.
Description
Keywords
Computer Science