On the metric properties of discrete space-filling curves

Discrete space-filling curves are commonly used to reduce a multidimensional problem to a one-dimensional problem, and, as such, are exploited in a variety of image processing applications. The space-filling curve is essentially a linear traversal of the discrete multidimensional space. In order that this traversal be effective, the curve should preserve “locality”, namely, that points close in the original multidimensional space be close in their ordering along the curve, and vice versa. We quantify “locality” and provide upper and lower bounds on the locality of multidimensional space-filling curves. We also bound the locality of the classic Hilbert space-filling curves, showing that they come close to achieving optimal locality