Single Bend Wiring

Abstract The problem of wiring pairs of points with wires having at most one bend is considered. We develop an O ( n 2 ) algorithm to determine whether or not a set of n point pairs can be wired in this manner on a single layer. When this is possible, our algorithm generates the layout. We show that determining the maximum number of point pairs that can be wired in with at most one bend is NP-hard. The problem of determining the minimum number of layers needed to wire a set of n point pairs is also NP-hard.