An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model

Authors:
Danny Z. Chen;Jinhui Xu
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA;Department of Computer Science and Engineering, State University of New York at Buffalo, 201 Bell Hall, Buffalo, NY 14260, USA
Venue:
Computational Geometry: Theory and Applications
Year:
2001

Citing 9
Cited 1

Optimal point location in a monotone subdivision

SIAM Journal on Computing
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles

IEEE Transactions on Computers
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Dynamic orthogonal segment intersection search

Journal of Algorithms
Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time

SCG '87 Proceedings of the third annual symposium on Computational geometry
Rectilinear Path Problems Among Rectilinear ObstaclesRevisited

SIAM Journal on Computing
Rectilinear paths among rectilinear obstacles

Discrete Applied Mathematics
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

SIAM Journal on Computing
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model

IEEE Transactions on Computers

Rectilinearity Measurements for Polygons

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a two-layer interconnection model that is used for VLSI routing applications. The previously best known direct approach for this problem takes O(nlog^2n) time and O(nlogn) space, where n is the total number of obstacle edges. By using integer data structures and an implicit graph representation scheme (i.e., a generalization of the distance table method), we improve the time bound to O(nlog^3^/^2n) while still maintaining the O(nlogn) space bound. Comparing with the indirect approach for this problem, our algorithm is simpler to implement and is probably faster for a quite large range of input sizes.