By Topic

Generalized Manhattan path algorithm with applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Asano, T. ; Dept. of Appl. Electron., Osaka Univ., Neyagawa, Japan

The author presents an efficient algorithm for finding a route interconnecting two terminals of arbitrary polygonal shape in two layers. The main feature of the router to be distinguished from the existing grid-free routers is that it can handle large vias. The author has also considered the extension to multi-terminal nets and demonstrate a native algorithm which repeats the same path finding process for each constituent terminal. Careful considerations may lead to a more efficient way such that three regions (horizontal and vertical routable regions and via acceptable region) are not reconstructed each time but updated only around the path obtained. In order to do that a data structure has been devised which can implement insertions and deletions of line segments each in O(log n) time. Based on the proposed algorithm it is possible to solve a practical problem which is concerned with a layout design of bipolar LSIs. In this case the purpose is to find an orthogonal wiring route of predetermined width between pairs of terminals avoiding polygonal obstacles in two layers

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:7 ,  Issue: 7 )