Apologies if this turns out to be a repost, but I'm not sure my first

attempt made it through.

I'm looking for an algorithm that will take a set of unit squares in 2D

space and output the smallest number of rectangles that cover all and

only the unit squares. The algorithm doesn't have to be optimal, and I

can even tolerate some overlapping rectangles in the output (if that

helps), although I would prefer it if these were limited.

I appreciate any help.

Thank you,

Mark

Sent via Deja.com http://www.deja.com/

Before you buy.