Modified interval line representation and its applications to planar routing problems

Abstract

A modified interval line representation is proposed. This representation makes it possible to speed up some heuristics and algorithms for planar routing problems. This technique is illustrated by speeding up the heuristic proposed by Tsukiyama and Kuh for the double row routing problem. The heuristic suggested by Tsukiyama and Kuh for double row routing problem, can be implemented in O(n/sup 2/rlg r) time algorithm, whereas the implementation suggested by Tsukiyama and Kuh requires O(n/sup 3/r) time. It is also shown that the heuristic can be implemented in parallel in O(lg/sup 2/n+lg r) time using O(N/sup 4/+n/sup 2/r) processors on the concurrent read exclusive write (CREW) model.<>