Skip to main content
. Author manuscript; available in PMC: 2014 Jul 10.
Published in final edited form as: Comput Graph Forum. 2014 Jul 1;32(3prt4):471–480. doi: 10.1111/cgf.12134

Algorithm 3.

ID shuffling for a high dimensional grid

Define {Ni} = the number of cells in each dimension and Ni = 2ni, (niZ);
Define N = Π(Ni);
For each cell
 {Ii} = the cell’s grid index in each dimension;
 { Ii} = {reverse_bit(Ii)};
I′ = interleave_bit({ Ii});
 ID = N - I′;