Abstract
Given axis-parallel rectangular obstacles and crossing areas together with two pairs of terminals on the plane, our algorithm finds a shortest pair of rectilinear paths which connect the pairs of terminals and neither pass through any obstacles nor cross each other except in the crossing areas. The algorithm takes O(n log n)time and O(n)space, where n is the total number of obstacles and crossing areas.
