Timeline for k nearest points
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 1, 2016 at 4:57 | comment | added | Douglas Zare | The construction can be stated quite simply: Put $k$ points near each vertex of a regular pentagon, and one in the center. | |
| Mar 1, 2016 at 3:28 | comment | added | Cauchy | Also I used a neighborhood close to $q_1$, instead of $d(q_1,s_1m)$ to place the $k-1$ points. | |
| Mar 1, 2016 at 3:15 | comment | added | Cauchy | For a regular pentagon $L>d(p,q_i)$ is that correct or am I missing something? | |
| Feb 29, 2016 at 23:00 | history | answered | Mark Fischler | CC BY-SA 3.0 |