Channel routing in a Diagonal Overlap model

In this paper we study the channel routing problem (CRP) in a new routing model, called Overlap Diagonal Model (ODM), where the grid consists of right and left tracks displayed at +45° and ?45°. For the unrestrictedoverlap, we present an algorithm which achieves \(w = \left[ {\frac{d}{2}} \right] + 1\) , while for the restricted-overlap, we havew=d+1, whered is the channel density,w is the channel width.