Given a three-dimensional space containing the point [x,y,z], create all cubes (3-dimensional arrays) that contain it. Example: # data cubeDimension = 5 size=2 point = [ 3, 3, 3 ] cubesThatContainsIt = [ ([ 3, 3, 3 ], [ 4, 4, 4 ]), ([ 2, 3, 3 ], [ 3, 4, 4 ]), ([ 2, 2, 3 ], [ 3, 3, 4 ]), ([ 2, 2, 2 ], [ 3, 3, 3 ]) ] ] Imroved version of Build cube combinations which contain a given cell? Continue reading...