By Topic

A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon

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)
Guo-Hui Lin ; Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA ; Guoliang Xue

In this paper, we present a linear time algorithm for computing the hexagonal Steiner minimum tree for a set of points on the boundary of a regular hexagon. Computational results on randomly generated test problems show that our algorithm can find the optimal solutions on a 200 MHz Pentium within 18 seconds for n as large as 20000. It is expected that techniques of this paper may be generalized to the case where the points are on the boundary of a polygon

Published in:

Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on  (Volume:1 )

Date of Conference:

2000