On some distance problems in fixed orientations
SIAM Journal on Computing
Reducing the Steiner problem in a normal space
SIAM Journal on Computing
Preferred direction Steiner trees
GLSVLSI '01 Proceedings of the 11th Great Lakes symposium on VLSI
The X architecture: not your father's diagonal wiring
SLIP '02 Proceedings of the 2002 international workshop on System-level interconnect prediction
Minimum Networks in Uniform Orientation Metrics
SIAM Journal on Computing
Computing the Shortest Network under a Fixed Topology
IEEE Transactions on Computers
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees
ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design
The Y-Architecture for On-Chip Interconnect: Analysis and Methodology
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
The Y-architecture: yet another on-chip interconnect solution
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Comment on "Computing the Shortest Network under a Fixed Topology'
IEEE Transactions on Computers
Locally minimal uniformly oriented shortest networks
Discrete Applied Mathematics
Computational complexity for uniform orientation Steiner tree problems
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
| Hi-index | 0.00 |
We consider the problem of constructing Steiner minimum trees for a metric defined by a polygonal unit circle (corresponding to 驴 驴 2 weighted legal orientations in the plane). A linear-time algorithm to enumerate all angle configurations for degree three Steiner points is given. We provide a simple proof that the angle configuration for a Steiner point extends to all Steiner points in a full Steiner minimum tree, such that at most six orientations suffice for edges in a full Steiner minimum tree. We show that the concept of canonical forms originally introduced for the uniform orientation metric generalises to the fixed orientation metric. Finally, we give an O(驴 n) time algorithm to compute a Steiner minimum tree for a given full Steiner topology with n terminal leaves.