Key points are not available for this paper at this time.
Abstract An algorithm for the exact solution of the Steiner problem in the Euclidean plane is presented. Compared with earlier algorithms, it generates full topologies in a different manner whereby the number of computations is substantially reduced. Furthermore, a large number of full Steiner trees which do not belong to the Steiner minimal tree is identified and discarded by new and efficient tests. The algorithm appears to be considerably faster than any other existing algorithm.
Paweł Winter (Sun,) studied this question.