Description
| 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. |
|---|
| Item Description: | Undergraduate thesis written for Program year: 1981/1982 |
|---|
| Physical Description: | 1 online resource (19 pages).
Digitized from print version held at Pickle Center High Density Storage, barcode 24829681 |
|---|