## Abstract

An algorithm for a special case of wire routing is presented. Given a rectangular circuit component on a planar surface with terminals around its boundary, the algorithm finds an optimal set of paths in the plane connecting specified pairs of terminals. The paths are restricted to lie on the outside of the component and must consist of line segments orthogonal to the sides of the component. Paths may intersect at a point but may not overlap. The criterion for optimality is the area of a rectangle with sides orthogonal to those of the component which circumscribes the component and paths. The algorithm has running time 0(t**3), where t is the number of terminals on the component.

Original language | English (US) |
---|---|

Pages (from-to) | 282-293 |

Number of pages | 12 |

Journal | Annual Symposium on Foundations of Computer Science - Proceedings |

State | Published - 1980 |

Event | Annu Symp Found Comput Sci Proc 21st - Syracuse, NY, USA Duration: Oct 13 1980 → Oct 15 1980 |

## All Science Journal Classification (ASJC) codes

- Hardware and Architecture