Timeline for Threading pinholes in the wall of cylinder to pass through an internal coordinate
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 12, 2017 at 23:25 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image links broken; now fixed.
|
| Oct 2, 2011 at 4:39 | comment | added | Gerhard Paseman | Also, one can devise a coordinate system and break the problem into vertical (2n complete bipartite plus regular grid graph) and horizontal (m complete regular polygonal graph). components. Although I had the idea before, your picture nicely suggests such a break down of the problem. Gerhard "Likes To See Pretty Pictures" Paseman, 2011.10.01 | |
| Oct 2, 2011 at 4:32 | comment | added | Gerhard Paseman | Actually it brings to mind a work of Poonen et al on the number and arrangement of diagonals of regular n-gons. I do not recall the exact reference, but something about there being at most 6 concurrent diagonals comes to mind, excepting the center. It might say how many interior regions and may give other clues to an answer. Perhaps someone else will provide the reference and more detail. Gerhard "Ask Me About System Design" Paseman , 2011.10.01 | |
| Oct 2, 2011 at 1:42 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |