algorithm - Mapping Hilbert values to 3D points -


I have a set of Hilbert values ​​(length from the beginning of the given point).

What is the best way to convert these values ​​into 3D digits? The original Hilbert curve was not in 3D, so I think I have to choose the Hilbert curve ranks by myself which I need. I have the length of the total curve (i.e., the maximum value in the set).

What is an existing implementation perhaps? Some libraries that will allow me to work with Hilbert curve / values? Language does not matter.

No response to 3D conversions, but a good algorithm and discussion of Hilbert's values 4 algorithms AR butt for the 4-dimensional Hilbert space-filling curve, "Alternative Algorithm for the Hilbert Space-Filling Curve", IEEE Trans,

to

Comp., April, 1971, pp 424-426 [But 1971] * Switzerland Thomas, "Hilbert.", Utah Raster Toolkit, circa 1993, http://web.mit.edu/afs/athena/contrib/urt /src/urt3.1/urt-3.1b Tar.gz * D. In Moore, Fast Hilbert Curves C, the calculation of mapping between another en-dimensional values ​​using * jaclawar, Hilbert Space-Filling curve without recursion [JL1_00]

< / Html>

Comments