Generation of spatial orders and space-filling curves

Space-filling curves have been found useful for many applications in diverse fields. A space-filling curve is a path in a 2(r)×2(r) raster domain, which visits each location exactly once. In mathematical terms, space-filling curves linearize a 2D integer space, bijectively mapping the space to the integer line. An algorithm is presented, which generates a large number of space-filling curves/spatial orders. Functions are derived such that the code of each location can be calculated from its coordinates and, conversely, a location code can be decoded to yield the coordinates. The algorithm first generates generate 4×4 spatial orders; they subsequently may be scaled up to any desired domain of size 2(r)×2(r) . The underlying theory of the algorithm, the processes for scaling up, encoding, and decoding are described in detail. The curves are generated as a set of incongruent curves, followed, if required, by the sets of associated congruent curves. A number of space-filling curves are illustrated.