Timeline for Minimum number of polygonal lines connecting points in an annulus.
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 25, 2011 at 11:59 | answer | added | André Schlichting | timeline score: 2 | |
| Mar 25, 2011 at 11:29 | answer | added | Joseph O'Rourke | timeline score: 0 | |
| Mar 25, 2011 at 1:38 | comment | added | Igor Rivin | Is "minimal number of polygonal lines" = "the minimal number of straight-line segments in a line joining the two points"? | |
| Mar 25, 2011 at 1:33 | comment | added | Gerry Myerson | It seems clear that the maximum should be achieved when the two points are $-a$ and $a$. Then some geometry of tangent lines should get to an answer. Did you try this approach? | |
| Mar 25, 2011 at 1:26 | history | asked | Jack Rousseau | CC BY-SA 2.5 |