Key points are not available for this paper at this time.
It is shown that the problem of computing Steiner minimal trees for general planar point sets is inherently at least as difficult as any of the NP-complete problems (a well known class of computationally intractable problems). This effectively destroys any hope for finding an efficient algorithm for this problem.
Garey et al. (Wed,) studied this question.