Timeline for Minimum number of polygonal lines connecting points in an annulus.
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2017 at 10:27 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
| Mar 25, 2011 at 22:20 | comment | added | Gerry Myerson | @Joseph, I see your figure and Andre's answer as expansions of my comment on the original question, a comment which I hoped OP would pick up on and develop himself into something like Andre's answer. But OP seems to have left the room. | |
| Mar 25, 2011 at 12:22 | comment | added | Joseph O'Rourke | @Gerry: Your interpretation makes sense, in which case my figure supports André's answer. | |
| Mar 25, 2011 at 11:31 | comment | added | Gerry Myerson | I took the problem to be, bound the number of segments in terms of $a$ and $b$. | |
| Mar 25, 2011 at 11:29 | history | answered | Joseph O'Rourke | CC BY-SA 2.5 |