Please use this identifier to cite or link to this item: doi:10.22028/D291-26108
Title: Routing through a rectangle
Author(s): Mehlhorn, Kurt
Preparata, Franco P.
Language: English
Year of Publication: 1983
OPUS Source: Saarbrücken, 1983
Free key words: VLSI
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: In this paper we present an O(Nlog N) algorithm for routing through a rectangle. Consider an n by m rectangular grid and a set of N two-terminal nets. A net is a pair of points on the boundary of the rectangle. A layout is a set of edge-disjoint paths, one for each net. Our algorithm constructs a layout, if there is one, in time O(NlogN) which contrasts favorably to the area of the layout which might be as large as N^{2}. The layout constructed can be wired using 4 layers of interconnect with only O(N) contact-cuts. A partial extension to multi-terminal nets is also discussed.
Link to this record: urn:nbn:de:bsz:291-scidok-41425
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1983/12
Date of registration: 2-Sep-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1983_12.pdf6,1 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.