By Topic

A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle

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

3 Author(s)
Cohoon, J.P. ; Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA ; Richards, D.S. ; Salowe, J.S.

The problem of finding the minimum-length rectilinear Steiner tree that connects a set of points on the boundary of a rectangle is considered. A linear time algorithm for this problem is presented. The algorithm was implemented in C and executed on a Sun3 workstation. Many examples were solved in a fraction of a second. An example with over 250 terminals took 6.5 s.<>

Published in:

Computer-Aided Design, 1988. ICCAD-88. Digest of Technical Papers., IEEE International Conference on

Date of Conference:

7-10 Nov. 1988