By Topic

Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection

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

4 Author(s)
Liu, C.-H. ; Grad. Inst. of Electron. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Shih-Yi Yuan ; Sy-Yen Kuo ; Jung-Hung Weng

For the obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem, this paper presents a Steiner-point based algorithm to achieve the best practical performance in wirelength and run time. Unlike many previous works, the Steiner-based framework is more focused on the usage of Steiner points instead of the handling of obstacles. This paper also proposes a new concept of Steiner point locations to provide an effective as well as efficient way to generate desirable Steiner point candidates. Experimental results show that this algorithm achieves the best solution quality in ¿(n log n) empirical time, which was originally generated by applying the maze routing on an ¿(n2)-space graph. The Steiner-point based framework and the new concept of Steiner point locations can be applied to future research on the OARSMT problem and its generations, such as the multi-layer OARSMT problem.

Published in:

Computer-Aided Design - Digest of Technical Papers, 2009. ICCAD 2009. IEEE/ACM International Conference on

Date of Conference:

2-5 Nov. 2009