Timeline for Example of convex n-gon that cannot be decomposed into k congruent convex polygons
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2018 at 5:10 | comment | added | Gerhard Paseman | I was trying to come up with simple examples that would require a large number of congruent polygons for a proper decomposition. I decided to try a near square, or a square with a small right triangle glued to one edge so that it was half of a 1 by (2+epsilon) rectangle. Imagine my surprise when I found a dissection into 3 pieces. It makes me wonder if such polygons (with k=3) can be classified. Gerhard "Also Reminds Me Of Rep-tiles" Paseman, 2018.06.21. | |
| Jun 21, 2018 at 3:58 | history | answered | fedja | CC BY-SA 4.0 |