The question Algorithm for finding the fewest rectangles to cover a set of rectangles was already answered here and a similar question was answered here. Those questions were about regular geometric rectangles, where the coordinates are continuous and form an order.
Is it possible to generalize the problem, such that instead of rectangles we use cartesian products of two sets, where each set is a subset of one axis. This axes themselves should not be continuous but finite sets. These products would look more like a "grid" than a rectangle.
My actual problem is finding a minimal representation for a function a->b->Bool
, but I believe this is equivalent to finding a minimal representation for a set of points (correct me if I'm wrong)
Should it not be possible to find a minimal set of cartesian products, is it possible to find a "good enough" solution?