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.