Jump to the code Today I present a novel technique for mapping a point in the $$d$$-dimensional plane to its corresponding $$d*n$$-bit offset on the $$n$$th order Hilbert curve with a running time of $$O(log(n))$$ on a processor with $$n$$-bit words. While a large constant factor makes it infeasible in higher dimensions, it is significantly […]