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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |
| Publisher | IEEE |
| Volume | 1 |
| State | Published - 2000 |
| Externally published | Yes |
| Event | Proceedings of the IEEE 2000 Internaitonal Symposium on Circuits and Systems - Geneva, Switz Duration: May 28 2000 → May 31 2000 |
Other
| Other | Proceedings of the IEEE 2000 Internaitonal Symposium on Circuits and Systems |
|---|---|
| City | Geneva, Switz |
| Period | 5/28/00 → 5/31/00 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials
Fingerprint
Dive into the research topics of 'Linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS