## Geometric Interconnection and Placement Algorithms (1995)

Citations: | 10 - 3 self |

### BibTeX

@MISC{Ganley95geometricinterconnection,

author = {Joseph Lavinus Ganley},

title = {Geometric Interconnection and Placement Algorithms},

year = {1995}

}

### OpenURL

### Abstract

This dissertation examines a number of geometric interconnection, partitioning, and placement problems arising in the field of VLSI physical design automation. In particular, many of the results concern the geometric Steiner tree problem: given a set of terminals in the plane, find a minimum-length interconnection of those terminals according to some geometric distance metric. Two new algorithms are introduced that compute optimal rectilinear Steiner trees. Both are provably faster than any previous algorithm for instances small enough to solve in practice, and both are also fast in practice. The first algorithm is a dynamic programming algorithm based on decomposing a rectilinear Steiner tree into full trees. A full tree is a Steiner tree in which every terminal is a leaf. Its time complexity is O(n3^n), where n is the number of terminals. The second algorithm modifies the first by the use of full-set screening, which is a process by which some candidate full trees are eliminated f...