Timeline for Trees with a maximal convex hull: are the only optimal solutions Steiner trees?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Sep 22, 2014 at 6:52 | vote | accept | Wolfgang | ||
| Sep 21, 2014 at 19:21 | answer | added | Jan Kyncl | timeline score: 5 | |
| Sep 21, 2014 at 16:11 | history | edited | Wolfgang | CC BY-SA 3.0 |
added remark about n=2,3,4
|
| S Sep 20, 2014 at 20:01 | history | suggested | F. C. |
added one tag for trees
|
|
| Sep 20, 2014 at 19:59 | review | Suggested edits | |||
| S Sep 20, 2014 at 20:01 | |||||
| Sep 20, 2014 at 19:20 | answer | added | Joseph O'Rourke | timeline score: 1 | |
| Sep 20, 2014 at 9:10 | comment | added | Wolfgang | @JosephO'Rourke I cannot see how to introduce a lattice. In my setting, all segments composing the tree have the same length. | |
| Sep 19, 2014 at 23:16 | comment | added | Joseph O'Rourke | This may be a distraction, but I wonder if your question could be more easily answered on a lattice? You probably know there is work on lattice Steiner trees, e.g., "Minimal Steiner Trees for Rectangular Arrays of Lattice Points." | |
| Sep 19, 2014 at 18:31 | comment | added | Wolfgang | I automatically thought of the volume. But definitely also a nice idea to wonder about maximizing the surface! | |
| Sep 19, 2014 at 18:12 | comment | added | Joseph O'Rourke | In $\mathbb{R}^3$, would you be seeking the maximum surface area of the hull, or the maximum volume? | |
| Sep 19, 2014 at 17:21 | history | asked | Wolfgang | CC BY-SA 3.0 |