An Algorithm For Automated Placement And Routing Using Barycentric Embedding
Abstract
This study presents an automated integrated circuit and printed circuit routing algorithm based on barycentric embedding. This algorithm deals with circuits which are represented as graphs. In order to utilize this barycentric embedding technique, it is necessary for the graphs to be planar and 3-connected. The algorithm involves a modification of the Hopcroft and Tarjan planarity test and their algorithm for dividing a graph into 3-connected components. The development of this algorithm is a preliminary step to the implementation of a computer program which will perform the automated routing function.
Description
Program year: 1981/1982Digitized from print original stored in HDR
Subject
automated integrated circuitbarycentric embedding
printed circuit routing algorithm
Hopcroft and Tarjan planarity test
Citation
Lew, Cynthia (1982). An Algorithm For Automated Placement And Routing Using Barycentric Embedding. University Undergraduate Fellow. Available electronically from https : / /hdl .handle .net /1969 .1 /CAPSTONE -FadelyJ _1982.