I have a problem whereby, given an arbitrary polygon with any number of points, I need to cover the whole area by a number of fixed size squares.  I can easily find a set of squares which covers the polygon but I need to ensure that I find the minimum number of squares.

Can anyone suggest a good method to do this?

Thanks in advance.