Timeline for Maximizing the distance sum of some points inside a circle
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2021 at 1:07 | vote | accept | Shiyu | ||
| May 10, 2021 at 11:58 | comment | added | Jukka Kohonen | I believe the new question (on a sphere) is sufficiently different that it would be better asked in a separate question. | |
| May 10, 2021 at 9:25 | answer | added | Fedor Petrov | timeline score: 3 | |
| May 10, 2021 at 9:09 | comment | added | Alapan Das | @Fedor Petrov, oh, I see. Thank you for correcting me. I had mistakenly assumed the barycentre at 0 as the points making regular $n$-gon on the sphere. | |
| May 10, 2021 at 8:49 | comment | added | Fedor Petrov | @AlapanDas not only, it happens when they are on the circle and 0 is barycentre | |
| May 10, 2021 at 8:23 | history | edited | Shiyu | CC BY-SA 4.0 |
added 304 characters in body
|
| May 10, 2021 at 5:11 | history | edited | YCor |
edited tags
|
|
| May 9, 2021 at 15:45 | comment | added | Alapan Das | For, $a=2$, $J=n\sum_{i}r_i^2 -[S_x^2+S_y^2+S_3^2]$ where, $r_i$ is the distance from the origin and $S_{x,y,z}=\sum_{i} \{x,y,z\}_i$. Hence, it will be maximum iff $(S_x,S_y,S_z)=\vec{0}$ and distances are maximum possible. This happens only when all the points are on the circle and forms a regular $n$-gon. | |
| May 9, 2021 at 1:34 | review | First posts | |||
| May 9, 2021 at 5:52 | |||||
| May 9, 2021 at 1:21 | history | asked | Shiyu | CC BY-SA 4.0 |