Timeline for Triangle with largest perimeter in a convex region
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 2, 2014 at 9:58 | comment | added | Ilya Bogdanov | Sorry, my previous comment was a result of a miscomputation. The circle is indeed the best among ellipses. | |
Mar 2, 2014 at 2:59 | answer | added | Wlodek Kuperberg | timeline score: 11 | |
Mar 2, 2014 at 0:58 | answer | added | Joseph O'Rourke | timeline score: 2 | |
Mar 1, 2014 at 16:29 | comment | added | Benoît Kloeckner | @JosephO'Rourke: the circle of radius $1/\sqrt{\pi}$ does. | |
Mar 1, 2014 at 15:15 | comment | added | Joseph O'Rourke | Can you tell us which shape achieves the extremal $2/\sqrt{\pi}$ segment? | |
Mar 1, 2014 at 7:38 | history | edited | Ricardo Andrade |
replaced deprecated tag 'geometry'
|
|
Mar 1, 2014 at 2:02 | comment | added | Yoav Kallus | a region $C$ that minimizes $r$ would probably have this property: mathoverflow.net/questions/78165/… | |
Mar 1, 2014 at 0:47 | comment | added | Wlodek Kuperberg | A quick observation: If triangle $PQR$ contained in $C$ is of maximum perimeter, then $C$ is contained in the intersection of three ellipses, each having foci at two of the points $P$, $Q$, $R$ and passing through the third. | |
Mar 1, 2014 at 0:27 | comment | added | Joseph O'Rourke | A bit of a tangent, but: The maximum perimeter triangle inscribed in a convex $n$-gon can be found in $O(n \log n)$ time: Boyce, James E., David P. Dobkin, Robert L. Drysdale III, and Leo J. Guibas. "Finding extremal polygons." SIAM Journal on Computing, 14, no. 1 (1985): 134-147. | |
Mar 1, 2014 at 0:07 | review | First posts | |||
Mar 1, 2014 at 0:09 | |||||
Feb 28, 2014 at 23:50 | history | asked | Richard Huguley | CC BY-SA 3.0 |