I generated a random minimum spanning tree for both a square plane of length 4096 and a cube of length 256.
I ordered the points by means of a breadth-first search and created a bijection between the two such that each coordinate point in the plane had a unique coordinate point in the cube which is equivalent to its colour values (X,Y,Z)=(R,G,B)