A simple general method for constructing space-filling curves is presented, based on the use of tables. It is shown how the use of Hilbert's curve can enhance the performance of Warnock's algorithm. A procedure is given which generates Hilbert curves or Sierpinski curves. A second procedure is given which generates Warnock's windows in Hilbert orde
Abstract R-trees can be used to store and query sets of point data in two or more dimensions. An eas...
AbstractThis paper describes a method of producing projective curves with easily computed Hilbert fu...
Hilbert’s two-dimensional space-filling curve is appreciated for its good locality properties for ma...
AbstractThe subject of this paper is a means of converging to a set of numbers in certain mathematic...
This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arb...
The formulation of space filling curves for one-to-one bidirectional mappings between multidimension...
This paper introduces a new way of generalizing Hilbert’s two-dimensional space-filling curve to arb...
The first part of this thesis deals with Cantor's bijection and the historical develop- ment of the ...
A space-filling curve (SFC) is a way of mapping a multi-dimensional space into a one-dimensional spa...
A space-filling curve is a way of mapping the discrete multi-dimensional space into the one-dimensio...
Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in...
The use of space filling curves for proximity-improving mappings is well known and has found many us...
This paper presents the time complexity of two algorithms that update space-filling curves of adapti...
Space-filling curves have been widely used in mathematics and to transform multi-dimensional problem...
We present a tensor product formulation for Hilbert space-filling curves. Both recursive and iterati...
Abstract R-trees can be used to store and query sets of point data in two or more dimensions. An eas...
AbstractThis paper describes a method of producing projective curves with easily computed Hilbert fu...
Hilbert’s two-dimensional space-filling curve is appreciated for its good locality properties for ma...
AbstractThe subject of this paper is a means of converging to a set of numbers in certain mathematic...
This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arb...
The formulation of space filling curves for one-to-one bidirectional mappings between multidimension...
This paper introduces a new way of generalizing Hilbert’s two-dimensional space-filling curve to arb...
The first part of this thesis deals with Cantor's bijection and the historical develop- ment of the ...
A space-filling curve (SFC) is a way of mapping a multi-dimensional space into a one-dimensional spa...
A space-filling curve is a way of mapping the discrete multi-dimensional space into the one-dimensio...
Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in...
The use of space filling curves for proximity-improving mappings is well known and has found many us...
This paper presents the time complexity of two algorithms that update space-filling curves of adapti...
Space-filling curves have been widely used in mathematics and to transform multi-dimensional problem...
We present a tensor product formulation for Hilbert space-filling curves. Both recursive and iterati...
Abstract R-trees can be used to store and query sets of point data in two or more dimensions. An eas...
AbstractThis paper describes a method of producing projective curves with easily computed Hilbert fu...
Hilbert’s two-dimensional space-filling curve is appreciated for its good locality properties for ma...
DOI
Add to ORKG