Hilbert曲线的快速生成算法设计与实现

研究了Hilbert曲线的特征和现有经典算法，依据二分技术提出了一种全新的空间填充曲线生成算法，算法按照复制的思想将具有“形”特征的曲线问题转化为具有“数”特征的矩阵问题．因此对曲线的操作就转化为对矩阵的运算，而矩阵运算不用考虑绘制曲线方向问题，也不用考虑曲线始点和终点．实验结果表明，该算法比经典的L系统算法提高了将近1倍的速度，有意义的是，该算法为并行计算大型空间填充曲线提出了一种方案。

Fast Generation Algorithm Design and Realization of Hilbert Curve

In this paper, the character of Hilbert curve and current classical algorithms are studied, and a new generation algorithm of spacefilling curve is presented according to bisection technique. This algorithm transforms the curve question with "shaped" character to the matrix question with "numeral" character. So the operation of curve is changed to that of matrix, but matrix operation doesn't care the direction of curve and so does the begin point and end point of curve. Experiment shows that the algorithm is about one times faster than the famous L systems algorithm. It is significant that the algorithm presents a precept for parallel calculating high deepness spacefilling curve.