Timeline for Parameterizing the space of convex quadrilaterals
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2021 at 18:26 | vote | accept | CommunityBot | moved from User.Id=44143 by developer User.Id=481663 | |
| Nov 5, 2021 at 9:58 | comment | added | user44143 | @WlodAA, the conditions on $f$ allow its image to contain degenerate convex quadrilaterals but do not require them. | |
| Nov 5, 2021 at 8:19 | comment | added | Wlod AA | Are these convex quadrilaterals non-degenerated? | |
| Nov 5, 2021 at 2:22 | answer | added | Yoav Kallus | timeline score: 1 | |
| Nov 4, 2021 at 17:33 | comment | added | user44143 | @ManfredWeis, $3D$ reasoning is fine so long as $f$ outputs an ordered list of four elements of $P$. But the continuity of $f$ will rule out most sorting and extremal considerations. E.g. "the maximum distance of $Q,R,S,T$ from their average" is continuous, but no continuous function can choose one of $Q,R,S,T$ that attains it. | |
| Nov 4, 2021 at 17:26 | comment | added | Manfred Weis | What kind of operations are acceptable for $f$; i.e. is it admissible to do sorting, determining "extremal" pairs of edges, going via $3D$? As the diagonals of a convex quadrilateral have maximal weightsum it seems reasonable to map the heaviest non-adjacent pair of edges to the intersecting pair. | |
| Nov 4, 2021 at 13:49 | history | asked | user44143 | CC BY-SA 4.0 |