Steiner’s minimal tree problem is this: Find the shortest possible network interconnecting a set of points in the Euclidean plane. If the points are linked directly to each other by straight line segments, we obtain the minimal spanning tree. But Steiner’s problem allows for additional points – now called Steiner points – to be added to the network, yielding Steiner’s minimal tree. This generally results in a reduction of the overall length of the network.
![Solution of Steiner 5-point problem with soap film [from Courant and Robbins].](https://thatsmaths.files.wordpress.com/2015/01/steiner-5point.jpg)
A solution of Steiner 5-point problem with soap film [from Courant and Robbins].
![From left to right: Figure-of-8 knot 4_1, knot 6_3 , knot 7_1, and knot 8_5 [Fig from Van Wijk (2006)].](https://thatsmaths.files.wordpress.com/2015/01/knots-vanwijk.jpg)
ThatsMaths 