Timeline for Always a planar-drawn cycle through $n$ points
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 18, 2015 at 20:18 | vote | accept | JMP | ||
| Dec 18, 2015 at 20:13 | comment | added | eric | Then count them from nearest to furthest from $A$. | |
| Dec 18, 2015 at 20:10 | comment | added | JMP | what if A, P, Q are colinear? | |
| Dec 18, 2015 at 19:56 | history | answered | Fedor Petrov | CC BY-SA 3.0 |