Timeline for closest equidistant point to N points in M dimensions
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2022 at 10:45 | history | edited | YCor |
edited tags
|
|
| Jan 18, 2022 at 9:14 | answer | added | Menachem | timeline score: 4 | |
| Jan 18, 2022 at 4:44 | answer | added | Manfred Weis | timeline score: 1 | |
| Jan 18, 2022 at 0:14 | answer | added | Saúl RM | timeline score: 4 | |
| Jan 17, 2022 at 22:39 | comment | added | Erik | It might not be too big an issue, but "assuming it exists" is doing a lot of heavy lifting for me here. N could be bigger than M... 8 points around a circle in 2-dimensional space have a closest equidistant point. The issue of whether such a point exists for me is only a step to finding what the point is IF it exists. | |
| Jan 17, 2022 at 21:52 | comment | added | Carlo Beenakker | a necessary condition for this to be possible is $N\leq M+1$, if I'm not mistaken; for a sufficient condition you also need to exclude $p+2$ points on a $p$-dimensional subspace (no three points on a line, no four points on a plane, ...); I'm guessing that this special point is the geometric median, for which an efficient algorithm exists. | |
| Jan 17, 2022 at 21:19 | history | asked | Erik | CC BY-SA 4.0 |