Timeline for Simple cake cutting puzzle
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2016 at 21:32 | comment | added | Gerhard Paseman | One can imagine a chord of the unit circle passing within $r \lt 1/2$ of the center. One can (for small $r$) rotate the circle by an angle of $k\pi/n$ radians to place up to $n$ chords, each which intersect each other, and no point is on three or more lines. This will give the maximum (and indeed only, given all n choose 2 points of intersection are within the unit circle) number of pieces for $n$ cuts. I am still struggling to see a good problem coming from this thread. Gerhard "No Matter How I Turn" Paseman, 2016.12.12. | |
| Dec 12, 2016 at 19:19 | comment | added | Joseph O'Rourke | @MohammadAl-Turkistany: Doesn't feel NP-hard to me. Judicious placement of the circle to capture exactly $K$ cells. Sorry, I don't see a clear algorithm at the moment... | |
| Dec 12, 2016 at 16:50 | comment | added | Mohammad Al-Turkistany | Thank you for your answer and the beautiful figure. Are you aware of the complexity of the above problems for the arrangement of $n$ lines? | |
| Dec 11, 2016 at 12:52 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |