Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!samsung!sol.ctr.columbia.edu!emory!hubcap!ncrcae!usceast!usceast.cs.scarolina.edu!chitale
From: chitale@usceast.cs.scarolina.edu (Parijat Chitale)
Newsgroups: comp.graphics
Subject: Minimum rectangles to cover a polygon
Message-ID: <3400@usceast.UUCP>
Date: 18 Aug 90 16:00:00 GMT
Sender: chitale@usceast.UUCP
Followup-To: comp.graphics
Organization: University of South Carolina, Columbia
Lines: 18

I am looking for an algorithm to cover a given polygon (co-ordinates of
all the vertices are known) by a minimum number of rectangles.  I have
seen algorithms to deal with covering of polygons with rectangles but 
have not come across one that would generate a minimal covering.
Any references about this, or any suggestions are really appreciated.

Thanx very much in advance,
-Parijat

-----------------------------------------------------------------------
God is really only another artist.  He invented the giraffe, the
elephant and the cat.  He has no real style, He just goes on trying
other things.
		-- Pablo Picasso

Parijat Chitale
[chitale@cs.scarolina.edu, ...!usceast!chitale]
SUN Aug 19 10:46:47 EDT 1990