Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
T. Bially (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: