The Hilbert curve algorithm provides a simple way to cluster data for faster storage and retrieval. It’s used to distribute work among high-performance computers. There is a version of R-trees that uses Hilbert curves to optimize node placement. The algorithm shows up in visualization, optimization, and resource allocation.
The BijectiveHilbert.jl package implements five versions of the Hilbert curve. All are type-stable and tested with factorial test designs. They include a fast 2D version, multiple N-dimensional algorithms, and one that creates Hilbert curves for N-dimensional cubes with varying side lengths.
The Hilbert curve can be very handy for ad-hoc clustering if you have it on-hand. I wanted to make a solid version available.
Hope All Is Well - Drew