A 2 d channel router for the diagonal model

Abstract

In this paper we consider two-terminal channel routing problems in a Diagonal Model (DM), where the grid consists of right and left tracks displayed at +45° and −45° on two layers. As in the Manhattan Model, the tracks are displaced in two layers with the left tracks on one layer and the right tracks on the other. InDM we prove a new lower bound to the channel width equal to d, and present an algorithm that obtains 2 d + 3 as an upper bound, where d is the channel density.