Efficient maze-running and line-search algorithms for VLSI layout

A new construct called the connection graph G/sup 4/, is proposed. An efficient geometric algorithm for constructing G/sup 4/ is given. A framework is presented for designing a class of time and space efficient maze-running and line-search rectilinear shortest path and rectilinear minimum spanning tree algorithms based on G/sup 4/. Several example maze-running and line-search algorithms based on G/sup 4/ are given to demonstrate the power of G/sup 4/ in designing good sequential VLSI routing algorithms.<
>