Timeline for Cutting convex regions into equal diameter and equal least width pieces - 3
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2021 at 19:02 | comment | added | Nandakumar R | Thanks. The fried potato problem seems to be related to the plank problem. And the plank problem appears related to the question of minimizing among the pieces of the highest least width. So, one part of question 3 above might have a ready answer. But as was mentioned in the previous post in this series (link above), maximizing the minimum least width among pieces might be different. | |
| May 29, 2021 at 8:48 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 286 characters in body
|
| May 29, 2021 at 6:02 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title
|
| May 29, 2021 at 5:33 | comment | added | Anthony Quas | I just supply a reference in case it’s relevant: John Conway posed what he called the fried potato problem, where you are given a convex body and asked to slice it minimizing the radius of the smallest ball it contains. | |
| May 28, 2021 at 21:35 | history | asked | Nandakumar R | CC BY-SA 4.0 |