algorithm - Find the maximum hyperrectangle contained in a set of points -
i have question similar 1 ( find largest rectangular block satisfying condition without iterating explicitly). in case have multidimensional (up 6 dimensions) binary array , want find largest hyperrectangle (by volume, i.e. product of dimensions) contains 1's.
for example, in 3d, data like:
data = table[if[i - j - k <= -1, 1, 0] , {i, 11} , {j, 11} , {k, 11} ];
http://i.imgur.com/brgiuoq.jpg
note i'm looking algorithm, , doesn't have written in mathematica.
Comments
Post a Comment