A decomposition theorem on Euclidean Steiner minimal trees.

The Euclidean Steiner minimal tree problem is known to be an NP-complete problem and current algorithms cannot solve problems with more than thirty points. Thus decomposition theorems can be very helpful in extending the boundary of doable problems. There have been only two known decomposition theorems in the literature. This paper provides a fifty percent increase in the reservoir of decomposition theorems.