Timeline for Pigeonholing Polygons: Can two rigid regions fit in twice the space needed?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 4, 2015 at 5:57 | comment | added | The Masked Avenger | could this approach generalize to three or four shapes? I'm thinking for the case of three shapes, draw one bisecting line, and then find a bisecting perpendicular ray of appropriate width coming off that line? | |
| May 17, 2015 at 15:54 | vote | accept | The Masked Avenger | ||
| May 17, 2015 at 6:26 | comment | added | Yoav Kallus | Yes, I am assuming $C$ is convex, which is needed for $A$ to contain $cC$. There are nonconvex bodies that don't contain a translate of their half-shrunk versions, and then things are hopeless. | |
| May 17, 2015 at 4:32 | comment | added | The Masked Avenger | Are you assuming convex C, or is this even more general? In any case it is looking like a good argument. | |
| May 17, 2015 at 3:16 | comment | added | Yoav Kallus | This should also work for pigeonholing $aC$ and $bC$ into $C$ in $d$ dimensions as long as $a+b<1$. | |
| May 17, 2015 at 3:07 | history | answered | Yoav Kallus | CC BY-SA 3.0 |