Recursive tilings and space-filling curves with little fragmentation

This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number a such that any ball Q can be covered by a tiles (or curve fragments) with total volume O(volume(Q)). Recursive tilings and space-filling curves with low Arrwwid numbers may be applied to optimise disk, memory or server access patterns when processing sets of points in Rd. This paper presents recursive tilings and space-filling curves with optimal Arrwwid numbers. When d >= 3, regular cube tilings and space-??lling curves cannot have optimal Arrwwid number; alternatives with better Arrwwid numbers are presented.

[1]  Herman J. Haverkort,et al.  Locality and bounding-box quality of two-dimensional space-filling curves , 2010, Comput. Geom..

[2]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[3]  H. V. Jagadish,et al.  Analysis of the Hilbert Curve for Representing Two-Dimensional Space , 1997, Inf. Process. Lett..

[4]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[5]  D. Hilbert.  Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .

[6]  Hiroshi Fukuda,et al.  Infinite Series of Generalized Gosper Space Filling Curves , 2005, CJCDGCGT.

[7]  Bernhard Bauer,et al.  Scalable community-driven data sharing in e-science grids , 2009, Future Gener. Comput. Syst..

[8]  D. Voorhies.  SPACE-FILLING CURVES AND A MEASURE OF COHERENCE , 1991 .

[9]  Akhil Kumar.  A Study of Spatial Clustering techniques , 1994, DEXA.

[10]  H. Lebesgue,et al.  Lecons Sur L'Integration Et LA Recherche Des Fonctions Primitives , 1973 .

[11]  Michael Bader,et al.  Cache oblivious matrix multiplication using an element ordering based on the Peano curve , 2006 .

[12]  Desh Ranjan,et al.  Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..

[13]  Herman J. Haverkort,et al.  Locality and bounding-box quality of two-dimensional space-filling curves , 2008, Comput. Geom..

[14]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[15]  G. Peano.  Sur une courbe, qui remplit toute une aire plane , 1890 .

[16]  Roger Wattenhofer,et al.  Space Filling Curves versus Random Walks , 1996, Algorithmic Foundations of Geographic Information Systems.

[17]  Rolf Niedermeier,et al.  Towards optimal locality in mesh-indexings , 1997, Discret. Appl. Math..

[18]  H. V. Jagadish,et al.  Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.

[19]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[20]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[21]  H. Hahn.  Leçons sur l'intégration et la recherche des fonctions primitives , 1904 .