Timeline for Counting points above lines
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2023 at 19:13 | comment | added | H A Helfgott | This is very nice. But can one do better if one knows that the points have $x$-coordinates $1/N, 2/N,\dotsc, 1$, say? And/or that the slopes of the lines are $1/N,2/N,\dotsc,N/N$? | |
| Jan 7, 2023 at 9:07 | comment | added | H A Helfgott | I don't see right away how that problem can be easier. The general problem (where the half-planes can be upper or lower half-planes) reduces to the problem for lower half-planes: just divide an instance of the general problem into two - one for the "upwards halfplanes" (just turn the page around so they become downwards halfplanes), one for the "downwards halfplanes" - and then add. | |
| Jan 7, 2023 at 5:38 | comment | added | domotorp | I think that the question is about a possibly easier problem, when all halfplanes face downwards. | |
| S Jan 7, 2023 at 2:03 | review | First answers | |||
| Jan 7, 2023 at 3:06 | |||||
| S Jan 7, 2023 at 2:03 | history | answered | Joseph Mitchell | CC BY-SA 4.0 |