A fast algorithm to test planar topological routability

Abstract

We develop a simple linear time algorithm to determine if a collection of two pin nets can be routed, topologically, in a plane (i.e. single layer). Experiments indicate that this algorithm is faster than the linear time algorithm of Marek-Sadowska and Tarngg1].

DOI: 10.1109/ICVD.1995.512069

Extracted Key Phrases

Cite this paper

@inproceedings{Lim1995AFA, title={A fast algorithm to test planar topological routability}, author={Andrew Lim and Sartaj Sahni and Venkat Thanvantri}, booktitle={VLSI Design}, year={1995} }