↧
Answer by Smylic for Minimum Number of Rectangles Needed to Cover a set of...
This is the Rectilinear Picture Compression problem that is known to be NP-hard (see textbook Computer and Intractability, a guide to the theory of NP-completeness by Garey and Johnson, p. 232, SR25)....
View ArticleMinimum Number of Rectangles Needed to Cover a set of square in an $\text{N}...
There is an $\text{N} \times \text{N}$ grid of squares. Some arbitrary subset of those squares must be covered by some number of rectangles (a given square must be covered entirely by one rectangle,...
View Article