  In this paper we introduce an algorithm of construction of cyclic
space-filling curves. One particular construction provides a family of
space-filling curves in all dimensions (H-curves). They are compared here with
the Hilbert curve in the sense of clustering properties, and it turns out that
the constructed curve is very close and sometimes a bit better than the Hilbert
curve. At the same time, its construction is more simple and evaluation is
significantly faster.
