Space-filling curves are continuous surjective functions that map the unit interval [0,1] to a higher-dimensional region, such as the unit (hyper-)cube. They are usually based on a recursive subdivision of the higher-dimensional region into smaller tiles of similar shape, together with a definition of the order in which these tiles should be traversed by the curve.
A simple example is Hilbert's curve1). The curve is based on subdividing the unit square into a grid of 2×2 square cells, and simultaneously subdividing the unit interval into four subintervals. Each subinterval is then matched to a cell; thus Hilbert's curve traverses the cells one by one in a particular order: first the lower left cell, then the upper left cell, then the upper right cell, and finally the lower right cell. The mapping from unit interval to unit square is refined by applying the procedure recursively to each subinterval-cell pair, so that within each cell, the curve makes a similar traversal. The traversals within these cells are rotated and/or reflected in a specific way so that the traversal remains continuous from one cell to another (see figure on the left). The result is a fully-specified mapping f from the unit interval to the unit square. For example, f(6/64) would be the point that is reached by the curve when it completes the traversal of the sixth cell in the grid of 8×8=64 cells that results after three levels of subdivision (the red point in the figure).
The inverse of space-filling curve can be used to define a linear order on high-dimensional points; this order can then be used, for example, to decide how to store the points in a data structure in memory or on disk. Not all space-filling curves are equally effective at optimizing, for example, the disk access patterns of queries in such data structures. In our research, we study different curves and analyse them using abstract quality measures that are derived from the intended application.
My work in this area can be divided into three main categories: (1) exploring combinatorial possibilities for space-filling curves, (2) finding space-filling curves with optimal qualities with respect to certain applications, and (3) representations of space-filling curves, currently, in particular, by sound. At the end of this page you will find a fourth category, bycatch: some nice curves and tessellations which I stumbled on accidentally in the course of my research.
The following paper discusses what possibilities there are for constructing three-dimensional octant-by-octant self-similar cube-filling curves, and what distinct properties the different solutions have. A limited discussion of four-dimensional curves is included as well. The paper comes with a prototype for a software tool to explore the curves.
Regarding self-similar curves, the following paper has been succeeded by the one mentioned above. However, the following paper also contains some non-self-similar curves that sometimes offer somewhat better locality-preserving properties than the self-similar curves:
Face-continuous space-filling curves have the property that the interior of the set of points visited by any contiguous section of the curve is connected. The following paper discusses recursive tilings of acute triangles, and the impossibility of constructing face-continuous space-filling curves based on such tilings:
In three dimensions it seems hard too:
Physical processes are often simulated by computations on meshes. A mesh can be understood as a subdivision of physical space into cells of different sizes, depending on the required precision. The simulation proceeds by making several passes over the mesh, each time visiting all cells and updating values stored with its vertices, edges, faces and cells. Space-filling curves, or more generally, recursive traversal orders, can be very useful to organize data transfer, load balancing and mesh refinement in such applications. The following presentation gives an overview of the relevant properties and quality criteria of recursive traversal orders, and presents some recent results about which combinations of desirable properties can be achieved.
The Arrwwid number of a space-filling curve is the smallest number A, such that any ball with volume B can be covered by A contiguous pieces of the curve of total size O(B). Arguably, sorting points along space-filling curves with low Arrwwid numbers make for data structures that can be queried efficiently: they would allow any range query with a ball to be answered by scanning only A relatively small sections of the data structure on disk, inducing only A seek operations. In the following paper we study curves with small Arrwwid numbers, and lower bounds on the smallest possible Arrwwid number, in two and more dimensions.
A space-filling curve f preserves locality well, if, for any a and b in [0,1], the points f(a) and f(b) (and maybe also the points f(c) for c∈[a,b]) lie, according to some distance measure, close to each other, relative to b−a. In the following paper we develop a technique to calculate how well a given space-filling curve preserves locality, and we prove some lower bounds on certain locality measures for certain types of space-filling curves.
In my papers on three-dimensional Hilbert curves (see above), we explore locality properties of generalizations of Hilbert's space-filling curve to higher dimensions. The paper mentioned below presents d-dimensional “Hilbert” curves, for any d ≥ 2, with the following property: the size of the minimum axis-aligned bounding box of the points f(c) for c∈[a,b] is never more than 4(b−a). In contrast, with commonly used generalizations of Hilbert curves, the worst possible ratio between bounding box size and (b−a) depends exponentially on the number of dimensions d.
We can define extradimensional space-filling curves approximately as follows: a D-dimensional space-filling curve F, filling a D-dimensional hypercube U, is extradimensional to a d-dimensional space-filling curve f if, for any d-dimensional face u of U that contains the origin of the coordinate system, the order in which the points of u are visited by F is the same as the order in which these points are visited by f when rotated onto u. In the following paper, we show experimental evidence that four-dimensional space-filling curves that are, to some extent, extradimensional to two-dimensional space-filling curves, can be useful in building data structures (R-trees) that store rectangles in the plane.
In the following manuscript, I present families of extradimensional space-filling curves for arbitrarily high dimensions. These could be used, for example, to build R-trees for boxes in three dimensions.