### Abstract

Efficient solutions are given to compute the optimal placement for a pair of VLSI modules interconnected by river routing. Specifically, let the (perpendicular) distance between the two modules be the separation, and call the (transverse) displacement the offset. This paper principally considers the separation problem: Given an offset and a wiring rule, find the minimum separation permitting a legal wiring. The design rules might use wires which are exclusively rectilinear, polygonal with a finite number of slopes, or possibly restricted to some other class of shapes such as circular arcs plus linear pieces. Techniques are developed which unify a variety of different placement problems, and give efficient solutions under extremely general conditions.

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

Pages (from-to) | 583-605 |

Number of pages | 23 |

Journal | SIAM Journal on Computing |

Volume | 17 |

Issue number | 3 |

State | Published - Jun 1988 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Theoretical Computer Science

### Cite this

*SIAM Journal on Computing*,

*17*(3), 583-605.

**Some geometry for general river routing.** / Siegel, Alan; Dolev, Danny.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 17, no. 3, pp. 583-605.

}

TY - JOUR

T1 - Some geometry for general river routing

AU - Siegel, Alan

AU - Dolev, Danny

PY - 1988/6

Y1 - 1988/6

N2 - Efficient solutions are given to compute the optimal placement for a pair of VLSI modules interconnected by river routing. Specifically, let the (perpendicular) distance between the two modules be the separation, and call the (transverse) displacement the offset. This paper principally considers the separation problem: Given an offset and a wiring rule, find the minimum separation permitting a legal wiring. The design rules might use wires which are exclusively rectilinear, polygonal with a finite number of slopes, or possibly restricted to some other class of shapes such as circular arcs plus linear pieces. Techniques are developed which unify a variety of different placement problems, and give efficient solutions under extremely general conditions.

AB - Efficient solutions are given to compute the optimal placement for a pair of VLSI modules interconnected by river routing. Specifically, let the (perpendicular) distance between the two modules be the separation, and call the (transverse) displacement the offset. This paper principally considers the separation problem: Given an offset and a wiring rule, find the minimum separation permitting a legal wiring. The design rules might use wires which are exclusively rectilinear, polygonal with a finite number of slopes, or possibly restricted to some other class of shapes such as circular arcs plus linear pieces. Techniques are developed which unify a variety of different placement problems, and give efficient solutions under extremely general conditions.

UR - http://www.scopus.com/inward/record.url?scp=0024018138&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024018138&partnerID=8YFLogxK

M3 - Article

VL - 17

SP - 583

EP - 605

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 3

ER -