ado@elsie.UUCP (Arthur David Olson) (05/22/87)
The problem: given an arbitrary bit map, find a set of filled rectangles that matches the bitmap while *minimizing the number of rectangles used*. An example: the bits ABCDEFGH u 00000000 v 00111100 w 00111100 x 00000110 y 00000110 z 00000000 are matched by two filled rectangles, the first running from row v to row w and from column C to column F, the second running from run x to row y and from column F to column G. If you've got a pointer to the solution, I'd appreciate hearing from you by mail. -- UUCP: ..seismo!elsie!ado ARPA: elsie!ado@seismo.CSS.GOV Elsie and Ado are trademarks of Borden, Inc. and Ampex.
ado@elsie.UUCP (Arthur David Olson) (05/22/87)
The problem: given an arbitrary bit map, find a set of filled rectangles that matches the bitmap while *minimizing the number of rectangles used*. An example: the bits ABCDEFGH v 00000000 w 00111100 x 00111110 y 00000110 z 00000000 are matched by two filled rectangles, the first running from row w to row x and from column C to column F, the second running from run x to row y and from column F to column G. (Note that the duplicate coverage of row x column F is permissible.) If you've got a pointer to the solution, I'd appreciate hearing from you by mail. -- UUCP: ..seismo!elsie!ado ARPA: elsie!ado@seismo.CSS.GOV Elsie and Ado are trademarks of Borden, Inc. and Ampex.