Locally minimal uniformly oriented shortest networks Original Research Article

The Steiner problem in a image-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from image uniform orientations in the plane. This network is referred to as a minimum image-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.