Steiner tree construction for graphene nanoribbon based circuits in presence of obstacles

For special geometric structure, graphene nanoribbon based interconnect can be bent only in 0°, 60° and 120° angles. Hence the underlying routing grid of graphene nanoribbon based circuits and interconnects are aligned to these mentioned degrees only. Such a routing grid is known as triangular routing grid. In the routing paths of graphene nanoribbon based inter-connects some hexagonal obstacles may be present there due to some pre-existing routing paths or due to some other reasons. For a given source, a set of n sink terminals and a set of obstacles in a triangular grid we have to interconnect the source and the sink terminals avoiding the obstacles in such a way that hybrid cost is minimized. Here the interconnect cost due to length and bending is known as hybrid cost. In this paper, we propose an algorithm for the construction of obstacles-avoiding hexagonal steiner tree for graphene nanoribbon based circuits. The algorithm is tested in a random data set and the experimental results are quite encouraging.