There are only two curves of the meandering type. They are reflections of each other in the (0,0)-(1,1) diagonal.
The number of switch-backs is significantly larger. Starting basically with the same S shape, on the next step, in each of the nine available squares one has to select one of two possible alternatives, which leads to the estimate of 29 = 512 curves defined by 9-digit binary sequences. Of these, 24·2 = 32 are palindromic and lead to curves with central symmetry. The remaining asymmetric 480 = 512 - 32 split into pairs, in each of which the curves are obtained from each other by central symmetry with respect to the center of the unit square. Therefore, there appears to be 480/2 + 32 = 272 essentially distinct "Peano" curves.
Peano's Definition
The original Peano curve maps the unit interval [0,1] onto the unit square [0,1]×[0,1]. The mapping is based on the ternary system, so that all digits t below may only take on values 0, 1, 2. First define the digit transformation k:
kt = 2 - t.
Peano's function fp maps a ternary fraction .t1t2t3 ... into a point (xp(.t1t2t3 ...), yp(.t1t2t3 ...)) in the unit square, where xp and yp are defined, respectively, as
xp(.t1t2t3 ...) = .t1(kt2t3)(kt2+t4t5) ...
yp(.t1t2t3 ...) = .(kt1t2)(kt1+t3t4) ...
Where kv denotes, as usual, the vth iterate of k.
Reference
- H. Sagan, Space-Filling Curves, Springer-Verlag, 1994
Copyright © 1996-2009 Alexander Bogomolny