Timeline for How to minimize the length of a graph connecting n points in $\mathbb{R}^3$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2012 at 12:16 | history | edited | Dorian | CC BY-SA 3.0 |
added 44 characters in body
|
| Jan 30, 2012 at 14:49 | vote | accept | Dorian | ||
| Jan 30, 2012 at 12:40 | answer | added | Joseph O'Rourke | timeline score: 5 | |
| Jan 30, 2012 at 11:37 | history | edited | Dorian | CC BY-SA 3.0 |
Updated information obtained in comment.
|
| Jan 30, 2012 at 11:36 | comment | added | Koen S | For $n=4$ the vertices of a tetrahedron would be optimal. Also note that you can rephrase your problem to a sphere packing problem. | |
| Jan 30, 2012 at 11:23 | history | asked | Dorian | CC BY-SA 3.0 |