Given n affinely independent points in n-1 dimensional Euclidean space, how is the minimum Steiner treeminimum Steiner tree constructed? Or assuming that the topology of the Steiner tree is given, is there an easy way to find the minimum edge lengths? I want a closed form algorithm if possible, otherwise an iterative solution that converges to the right answer with some kind of error bound would also be useful.
