Minimal rectilinear Steiner trees

We consider the problem of constructing a minimal rectilinear Steiner tree for $n$ points on the plane. We prove a number of properties of these trees and describe a fast algorithm for solving this problem for $n\leqslant11$. We give a general solution for $n\leqslant6$.