A Steiner tree is the shortest network that connects three points.
The paths from the points meet at what is called the Steiner point.
Finding the Steiner Point
The Steiner Point is found using the Torricelli Construction:
Give points A, B and C, the triangle formed by the points is black.
Choose any one of the three sides of the triangle. The side chosen uses two of the vertices and excludes the third vertex. In this example, I've chosen side AC.
Locate a point X such that ACX is an equilateral triangle. In this example, the triangle is green.
Circumscribe a circle around the equilateral triangle. In this example, the circle is green.
Connect point X and the excluded vertex with a line segment. In this example, my green line segment is BX.
The intersection of the line segment and the circle is the Steiner point.
The Steiner Tree is red.
Finding the Length of the Steiner Tree
At the time I did this, I could not find the computation anywhere, so I spent an afternoon figuring it out.
Enter the lengths of the three sides of the triangle, then click the button.
