Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!elsie!ado
From: ado@elsie.UUCP (Arthur David Olson)
Newsgroups: comp.graphics
Subject: Wanted: way to find a set of filled rectangles == a set of pixels
Message-ID: <7423@elsie.UUCP>
Date: Thu, 21-May-87 19:42:26 EDT
Article-I.D.: elsie.7423
Posted: Thu May 21 19:42:26 1987
Date-Received: Sat, 23-May-87 12:55:56 EDT
Followup-To: poster
Organization: NIH-LEC, Bethesda, MD
Lines: 24

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.