Timeline for Covering an arbitrary polygon with minimum number of squares
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 19, 2023 at 18:16 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
fixed broken link to springerlink.com; used DOI for another link; updated another URL; added zbMATH review link in tooltip
|
| Apr 19, 2023 at 16:05 | review | Suggested edits | |||
| S Apr 19, 2023 at 18:16 | |||||
| Aug 2, 2017 at 10:35 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Broken link fixed.
|
| Jul 11, 2013 at 22:48 | comment | added | Erel Segal-Halevi | There is also this 1998 paper: duch.mimuw.edu.pl/~kowaluk/TOMEK/106-108.pdf "A better approximation algorithm for covering polygons with squares", by Grazyna Zwozniak, which improves upon Levcopoulos and Gudmundsson's results. | |
| Mar 15, 2012 at 14:09 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |