Timeline for Erdős-Szekeres empty pseudoconvex $k$-gons
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 23, 2017 at 23:59 | answer | added | Brendan McKay | timeline score: 3 | |
Mar 23, 2017 at 21:35 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
Aug 21, 2014 at 23:24 | comment | added | Douglas Zare | There must be some compatibility conditions between the usual geometry of the plane and the pseudolines. Otherwise, you can send any $n$ points and pseudolines through them to any other $n$ points and a combinatorially equivalent set of pseudolines, so there is nothing special about a given set of points, and you can choose the pseudolines so that the points are in convex position. This is not the case if you do something like say that the pseudolines have to be rotated graphs of functions. I don't know if that's a good condition but it's invariant under affine transformations. | |
Feb 15, 2012 at 1:56 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |