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

Guo Hui Lin, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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 20,000. It is expected that techniques of this paper may be generalized to the case where the points are on the boundary of a polygon.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
Volume1
StatePublished - 2000
Externally publishedYes
EventProceedings of the IEEE 2000 Internaitonal Symposium on Circuits and Systems - Geneva, Switz
Duration: May 28 2000May 31 2000

Other

OtherProceedings of the IEEE 2000 Internaitonal Symposium on Circuits and Systems
CityGeneva, Switz
Period5/28/005/31/00

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this