An algorithm for L-shaped channel routing in a diagonal model
Xiaoyu Song · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1992
The author investigates the two-terminal L-shaped channel routing problem (LRP) in the knock-knee diagonal model (KKD), where the grid consists of right and left tracks displayed at +45 degrees and -45 degrees . An optimal routing algorithm for the two-terminal simple LRP in KDD, which generates solutions matching the lower bound is presented.>