Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Rectilinear Steiner tree construction by local and global refinement

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

2 Author(s)
Chao, T.-H. ; Comput. & Commun. Res. Lab., Hsinchu, Taiwan ; Yu-Chin Hsu

Presents a new algorithm for constructing a rectilinear Steiner tree (RST) for a given set of points. Starting from a rectilinear minimum spanning tree (MST), the algorithm works by incrementally introducing “good” Steiner points into the point set and generating an MST from the enlarged point set. Steiner points are introduced in two stages according to their essentiality and cost. In the first stage, they are generated from the local structure of the tree; in the second stage, they are generated from the global structure using a loop detection method. The proposed algorithm outperforms most other algorithms of its class by the fact that the average cost improvement over the rectilinear minimum spanning tree is 10.4%, and its time complexity is O(n2 log n)

Published in:

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