Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Garey et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: