Timeline for Algorithm for 1-dimensional minimal surfaces
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2023 at 2:22 | comment | added | hardmath♦ | This is the Steiner tree problem, at least in the case you assume with points in 2D. There exists a polynomial-time approximation scheme (PTAS), but finding an optimal solution (for general numbers of points) is NP-hard. | |
| S Aug 3, 2023 at 22:53 | history | edited | Relja Šegvić | CC BY-SA 4.0 |
Improved formatting
|
| S Aug 3, 2023 at 22:53 | history | suggested | user7440 | CC BY-SA 4.0 |
Improved formatting
|
| Aug 3, 2023 at 2:29 | review | Suggested edits | |||
| S Aug 3, 2023 at 22:53 | |||||
| Jul 28, 2023 at 21:22 | comment | added | Maxim Umansky | This is a well known problem, and it is a minimal surface indeed, with translational symmetry. For the minimum length curve, if three lines connect at a joint point, they must make 120$^\circ$ angles between them because this boils down to minimization of an energy functional which leads to a force balance constraint. Some people even found how to use the properties of soap to find those minimal surfaces, putting soap film on a set of parallel rods placed at the location of your given 2D vertices. | |
| S Jul 28, 2023 at 19:21 | review | First questions | |||
| Aug 3, 2023 at 2:29 | |||||
| S Jul 28, 2023 at 19:21 | history | asked | Relja Šegvić | CC BY-SA 4.0 |