Alternative Algorithm for Hilbert's Space-Filling Curve
โ Scribed by Butz, A.R.
- Book ID
- 114587840
- Publisher
- IEEE
- Year
- 1971
- Tongue
- English
- Weight
- 624 KB
- Volume
- C-20
- Category
- Article
- ISSN
- 0018-9340
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The subject of this paper is a means of converging to a set of numbers in certain mathematical programming problems where a conventional programming method is not possible. The space filling curve is shown to provide a tool for doing this. An algorithm for generating such a curve is presented; the r
Based on a parametrization of Hilbert's space-$lling curve that was recently found by this author, an analytic proof of the nowhere dijjerentiability of the coordinate functions of that curve is presented. '$.> The Franklinlnstitute0016-0032/93 %6.00+000
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
A Hilbert space-filling curve is a curve traversing the 2 n ร 2 n two-dimensional space and it visits neighboring points consecutively without crossing itself. The application of Hilbert space-filling curves in image processing is to rearrange image pixels in order to enhance pixel locality. A compu