Non-crossing of plane minimal spanning and minimal T1 networks (Q1377869)

The paper considers shortest networks spanning a finite set of points in the Euclidean plane. The problem to find a shortest network overall, usually called a minimal Steiner network, is NP-hard. On the other hand, to find a minimal spanning tree needs substantially less time. Other networks of interest are the T1 networks which are networks where the components consist of spanning edges, and Steiner networks with three given and one additional point (Steiner point). Computing a minimal T1 network is also a hard problem. The paper proves that a minimal T1 network and a minimal spanning network for the same set of points cannot cross (the same statement holds true for two distinct minimal spanning networks, which was shown by J. H. Rubinstein and D. A. Thomas).