Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles (supercedes CS-92-39, CS-93-15, and CS-93-19)Report
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a geometric problem into a graph problem. It is the first model that allows computation of optimal obstacle-avoiding rectilinear Steiner trees in time corresponding to the instance size (the number of terminals and obstacle border segments) rather than the size of the routing area. For the most common multi-terminal critical nets---those with three or four terminals---we observe that optimal trees can be computed as efficiently as good heuristic trees, and present algorithms that do so. For nets with five or more terminals, we present algorithms that heuristically compute obstacle-avoiding Steiner trees. Analysis and experimental results demonstrate that the model and algorithms work well in both theory and practice. Also presented are several theoretical results: a derivation of the Steiner ratio for obstacle-avoiding rectilinear Steiner trees, and complexity results for two special cases of the problem.
All rights reserved (no additional license for public reuse)
Ganley, J, and J Cohoon. "Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles (supercedes CS-92-39, CS-93-15, and CS-93-19)." University of Virginia Dept. of Computer Science Tech Report (1994).
University of Virginia, Department of Computer Science