This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arbitrary dimensions. The new curves, called harmonious Hilbert curves, have the unique property that for any d' <d, the d-dimensional curve is compatible with the d'-dimensional curve with respect to the order in which the curves visit the points of any d'-dimensional axis-parallel space that contains the origin. Similar generalizations to arbitrary dimensions are described for several variants of Peano's curve (the original Peano curve, the coil curve, the half-coil curve, and the Meurthe curve). The d-dimensional harmonious Hilbert curves and the Meurthe curves have neutral orientation: as compared to the curve as a whole, arbitrary pieces...
A simple general method for constructing space-filling curves is presented, based on the use of tabl...
A space-filling curve is a way of mapping the discrete multi-dimensional space into the one-dimensio...
Two-dimensional R-trees are a class of spatial index structures in which objects are arranged to ena...
This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arb...
This paper introduces a new way of generalizing Hilbert’s two-dimensional space-filling curve to arb...
Hilbert's two-dimensional space-filling curve is appreciated for its good locality properties for ma...
Hilbert's two-dimensional space-filling curve is appreciated for its good locality-preserving proper...
Hilbert’s two-dimensional space-filling curve is appreciated for its good locality properties for ma...
Hilbert's two-dimensional space-filling curve is appreciated for its good locality-preserving proper...
Abstract R-trees can be used to store and query sets of point data in two or more dimensions. An eas...
The first part of this thesis deals with Cantor's bijection and the historical develop- ment of the ...
R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to ...
Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in...
This article describes sixteen different ways to traverse d-dimensional space recursively in a way t...
Peano curves are continuous mappings from the unit interval [0, 1] onto the n- dimensional square [0...
A simple general method for constructing space-filling curves is presented, based on the use of tabl...
A space-filling curve is a way of mapping the discrete multi-dimensional space into the one-dimensio...
Two-dimensional R-trees are a class of spatial index structures in which objects are arranged to ena...
This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arb...
This paper introduces a new way of generalizing Hilbert’s two-dimensional space-filling curve to arb...
Hilbert's two-dimensional space-filling curve is appreciated for its good locality properties for ma...
Hilbert's two-dimensional space-filling curve is appreciated for its good locality-preserving proper...
Hilbert’s two-dimensional space-filling curve is appreciated for its good locality properties for ma...
Hilbert's two-dimensional space-filling curve is appreciated for its good locality-preserving proper...
Abstract R-trees can be used to store and query sets of point data in two or more dimensions. An eas...
The first part of this thesis deals with Cantor's bijection and the historical develop- ment of the ...
R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to ...
Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in...
This article describes sixteen different ways to traverse d-dimensional space recursively in a way t...
Peano curves are continuous mappings from the unit interval [0, 1] onto the n- dimensional square [0...
A simple general method for constructing space-filling curves is presented, based on the use of tabl...
A space-filling curve is a way of mapping the discrete multi-dimensional space into the one-dimensio...
Two-dimensional R-trees are a class of spatial index structures in which objects are arranged to ena...