The steiner minimal network for convex configurations
- 47 Downloads
SupposeX is a convex configuration with radius of maximum curvaturer and at most one of the edges joining neighboring points has length strictly greater thanr. We use the variational approach to show the Steiner treeS coincides with the minimal spanning tree and consists of all these edges with a longest edge removed. This generalizes Graham's problem for points on a circle, which we had solved. In addition we describe the minimal spanning tree for certain convex configurations.
KeywordsSpan Tree Minimal Span Tree Discrete Comput Geom Steiner Tree Maximum Curvature
- 2.R. L. Graham, Some Results on Steiner Minimal Trees, Unpublished manuscript, 11 May 1967.Google Scholar