On Multidimensional Curves with Hilbert Property

@article{Alber2000OnMC,
  title={On Multidimensional Curves with Hilbert Property},
  author={J. Alber and R. Niedermeier},
  journal={Theory of Computing Systems},
  year={2000},
  volume={33},
  pages={295-312}
}
Abstract. Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in numerous fields, ranging from parallel processing over data structures to image processing. Because of an increasing interest in discrete multidimensional spaces, indexing schemes for them have won considerable interest. Hilbert curves are the most simple and popular space-filling indexing schemes. We extend the concept of curves with Hilbert property to arbitrary dimensions and… Expand
Norm-Based Locality Measures of Two-Dimensional Hilbert Curves
A discrete space-filling curve provides a 1-dimensional indexing or traversal of a multi-dimensional grid space. Applications of space-filling curves include multi-dimensional indexing methods,Expand
Norm-Based Locality Measures of Two-Dimensional Hilbert Curves
A discrete space-filling curve provides a 1-dimensional indexing or traversal of a multi-dimensional grid space. Applications of space-filling curves include multi-dimensional indexing methods,Expand
Norm-Based Locality Measures of Two-Dimensional Hilbert Curves
A discrete space-filling curve provides a 1-dimensional indexing or traversal of a multi-dimensional grid space. Applications of space-filling curves include multi-dimensional indexing methods,Expand
On the Locality Properties of Space-Filling Curves
TLDR
An analytical study of the locality properties of the m-dimensional k-order discrete Hilbert and z-order curve families is presented, which suggests that the z- order curve family performs better than the Hilbert curve family over the considered parameter ranges. Expand
How many three-dimensional Hilbert curves are there?
  • H. Haverkort
  • Computer Science, Mathematics
  • J. Comput. Geom.
  • 2017
TLDR
This work organizes and explores the space of possible three-dimensional Hilbert curves and the potentially useful properties which they may have, and discusses a notation system that allows us to distinguish the curves from one another and enumerate them. Expand
Norm-Based Locality Measures of Two-Dimensional Hilbert Curves
TLDR
The analytical results identify all candidate representative grid-point pairs (realizing the locality-measure values) for all real norm-parameters in the unit interval [1, 2] and grid-orders. Expand
Harmonious Hilbert curves and other extradimensional space-filling curves
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 thatExpand
Four-dimensional hilbert curves for R-trees
TLDR
By selecting a curve that has certain properties and choosing the right rotation, one can combine the strengths of the two-dimensional and the four-dimensional approach into one, while avoiding their apparent weaknesses. Expand
On p-Norm Based Locality Measures of Space-Filling Curves
TLDR
An analytical study on the locality properties of the 2-dimensional Hilbert curve family and results close the gaps between the current best lower and upper bounds with exact formulas for p ∈ {1, 2}, and extend to all reals p ≥ 2. Expand
Hyperorthogonal Well-Folded Hilbert Curves
TLDR
A new way of generalizing Hilbert's curve to higher dimensions is presented, which results in much tighter bounding boxes: they have at most 4 times the volume of the part of the curve covered, independent of the number of dimensions. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
Towards Optimal Locality in Mesh-Indexings
TLDR
A new indexing scheme is presented, called H- indexing, which has superior locality, and with respect to the Euclidean metric the H-indexing provides locality approximately 50% better than the usually used Hilbert indexing. Expand
Space Filling Curves and Mathematical Programming
  • A. Butz
  • Computer Science, Mathematics
  • Inf. Control.
  • 1968
TLDR
It is shown how to use knowledge of first and second order properties of the f i to obtain solutions on a digital computer using space filling curves as a basis for the concept of implicitly exhaustive search. Expand
Analysis of the Hilbert Curve for Representing Two-Dimensional Space
  • H. Jagadish
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1997
TLDR
These closed-form expressions for the average number of runs to cover an arbitrary square region in two dimensions using a Hilbert curve allow the estimation of the quality of the linearization obtained by using the Hilbert curve to map from a two- dimensional space to a one-dimensional space. Expand
Recursive 3D Mesh Indexing with Improved Locality
TLDR
This paper proposes a class of locality preserving indexing schemes of a 3D mesh with a smaller constant factor than previously known and evaluates the constant factors for a number of easy to computeindexing schemes in meshes of size up to 323 and provides asymptotic analytical bounds. Expand
Space-filling curves
The subject of space-filling curves has generated a great deal of interest in the 100 years since the first such curve was discovered by Peano. Cantor, Hilbert, Moore, Knopp, Lebesgue and Polya areExpand
Convergence with Hilbert's Space Filling Curve
  • A. Butz
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • 1969
TLDR
The space filling curve is shown to provide a tool for converging to a set of numbers in certain mathematical programming problems where a conventional programming method is not possible and an algorithm for generating such a curve is presented. Expand
Hilbert R-tree: An Improved R-tree using Fractals
TLDR
A new Rtree structure that outperforms all the older ones by proposing an ordering on the R-tree nodes, and using the so-called ‘2D-c’ method, which sorts rectangles according to the Hilbert value of the center of the rectangles. Expand
On the metric properties of discrete space-filling curves
TLDR
This work quantifies "locality" and bound the locality of multidimensional space-filling curves, which comes close to achieving optimal locality. Expand
Space-Filling Curves and Their Use in the Design of Geometric Data Structures
TLDR
A space filling curve (SFC) is a numbering of the cells of this grid with numbers from c+1 to c+N2, for some c≥0, if it can be recursively divided into four square RSFCs of equal size. Expand
Fractals for secondary key retrieval
TLDR
The use of fractals and especially the Hilbert curve is proposed, in order to design good distance-preserving mappings, which improve the performance of secondary-key- and spatial- access methods, where multi-dimensional points have to be stored on an 1-dimensional medium. Expand
...
1
2
3
...