Assume that G is an undirected planar graph and the edge length of G is a nonnegative real number. When k terminal pairs are specified on two specified face boundaries, this paper gives an algorithm that derives the “noncrossing paths” with the minimum sum of lengths that connects the respective terminal pairs. By the noncrossing paths is meant the paths which do not cross on the plane, although the point or the edge may be shared. the computation time of the proposed algorithm is O(n log n), where n is the number of points on the planar graph G; k need not be a constant.
|Number of pages||15|
|Journal||Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)|
|Publication status||Published - 1995 Apr|
- noncrossing paths
- Planar graph
- shortest‐path problem
- VLSI single‐layer routing