Shortest Networks for One Line and Two Points in Space
In this paper we study a new generalization of the Steiner tree problem: the shortest network interconnecting two points and a straight line in space. We prove that this shortest network, either with one access point on the line or the line being multi-accessible, can be computed exactly by solving a certain quartic equation. Moreover, we will show how Euclidean 3D-space can be partitioned into regions (point sets in space) which are defined by the topology of the Steiner minimal tree.
KeywordsAccess Point Steiner Tree Steiner Point Optimal Region Steiner Tree Problem
Unable to display preview. Download preview PDF.
- M.Brazil, D.A.Thomas and J.F.Weng, Gradient-constrained minimal Steiner trees, Proceedings of the DIMAGS Workshop on Network Design, to appear.Google Scholar
- G.X. Chen, The shortest path between two points with a (linear) constraint (in Chinese), Knowledge and Appl. Math., Vol. 4 (1980), pp. 1–8.Google Scholar
- D.M.Y. Sommerville, Analytical Conics, G. Bell and Sons Ltd., London, 1933.Google Scholar
- J.F.Weng, Computing Steiner points, unpublished manuscript.Google Scholar