Covering problems: Difference between revisions

Revision as of 12:09, 13 June 2014

Revision as of 22:02, 20 April 2017

Line 28:

* [[Disk covering problem]], the problem of covering a unit circle with smaller circles

* [[Polygon covering]], the problem of covering a complex polygon with simpler polygons such as squares or rectangles.

* The non-rectangle problem. The problem of covering a rectangular area without sub-rectangles. <ref>{{cite journal|last1=Martinez|first1=Rebecca|title=March Puzzle|journal=Triad Mensa|date=1 March 2014|volume=8|issue=3|page=2|url=http://www.triad.us.mensa.org/pdfs2010/Mar14TM.pdf|accessdate=20 April 2017}}</ref>

==Notes==