Skip to main content
removed deprecated (geometry) tag - see the tag info: http://mathoverflow.net/tags/geometry/info; if there are some other geometry-related tags which are suitable, please use some of them instead; addes a tag of computational geometry
Source Link
Taras Banakh
  • 42k
  • 3
  • 74
  • 183

I have a problem whereby, given an arbitrary polyognpolygon 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.

I have a problem whereby, given an arbitrary polyogn 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.

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.

removed deprecated (geometry) tag - see the tag info: http://mathoverflow.net/tags/geometry/info; if there are some other geometry-related tags which are suitable, please use some of them instead
Link
Source Link
Chris
  • 51
  • 1
  • 3

Covering an arbitrary polygon with minimum number of squares

I have a problem whereby, given an arbitrary polyogn 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.