Monotone bipartitioning problem in a planar point set with applications to VLSI
ACM Transactions on Design Automation of Electronic Systems (TODAES)
On finding an empty staircase polygon of largest area (width) in a planar point-set
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
New techniques are presented for routing L-shaped channels, switchboxes and staircases in 2-layer Manhattan-diagonal (MD) model with tracks in horizontal, vertical directions.First, a simple time algorithm is proposed which routes any L-shaped channel with length density and no cyclic vertical constraints, in tracks. Next, a time greedy method for routing an L-shaped channel with cyclic vertical constraints, is described. Then, the switchbox routing problem in MD model is solved elegantly. These techniques easily extendible to routing of staircase channels, yield efficient solutions to detailed routing in general floorplans. Experimental results show significantly low via-count and reduced wire length, thus establishing the superiority of MD-routing over classical strategies.