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.

中文翻译：

---

循环空间填充曲线及其聚类特性

在本文中，我们介绍了一种构建循环空间填充曲线的算法。一个特定的构造提供了一系列所有维度的空间填充曲线（H 曲线）。在这里将它们与 Hilbert 曲线在聚类特性的意义上进行比较，结果表明构建的曲线非常接近，有时比 Hilbert 曲线要好一些。同时，它的构建更简单，评估速度明显更快。