Timeline for closest equidistant point to N points in M dimensions
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2022 at 22:46 | history | edited | Saúl RM | CC BY-SA 4.0 |
deleted 85 characters in body
|
| Jan 18, 2022 at 19:22 | comment | added | Saúl RM | Okey. I suppose you have some program to calculate intersections of hyperplanes (?), so would the problem be obtaining the equations of the affine subspace generated by the points? | |
| Jan 18, 2022 at 19:01 | comment | added | Erik | Thank you! I'm sorry this explanation is a bit beyond my current math knowledge to know how to evaluate or implement. I'll do some research. | |
| Jan 18, 2022 at 10:11 | history | edited | Saúl RM | CC BY-SA 4.0 |
added 32 characters in body
|
| Jan 18, 2022 at 9:14 | history | edited | Saúl RM | CC BY-SA 4.0 |
added 4 characters in body
|
| Jan 18, 2022 at 9:08 | history | edited | Saúl RM | CC BY-SA 4.0 |
a bit more of detail added
|
| Jan 18, 2022 at 0:27 | history | edited | Saúl RM | CC BY-SA 4.0 |
added 175 characters in body
|
| Jan 18, 2022 at 0:14 | history | answered | Saúl RM | CC BY-SA 4.0 |