Space-filling curves: Their generation and their application to bandwidth reduction

Authors:
T. Bially
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

Information Sciences: an International Journal
Path planning of mobile landmarks for localization in wireless sensor networks

Computer Communications
Self-organization in spontaneous networks: the approach of DHT-based routing protocols

Ad Hoc Networks
Recursive pyramids and their use for image coding

Pattern Recognition Letters

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper introduces a class of finite-state algorithms which characterize self-similar space-filling curves. The curves enable one to continuously map a line onto anN-dimensional cube, and find application in compressing the bandwidth of arbitrary waveforms. The bandwidth compression is effected in return for an increased susceptibility of the signal to perturbations. The algorithms are represented in a diagrammatic form which enables one to convert theNcoordinates of a point in a cube into a single number representing the distance along a space-filling curve, or vice-versa, merely by visual inspection. The diagrams are always finite in size and may be constructed by following a rather simple numerical procedure.