Abstract
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edge segments are restricted to λ uniformly oriented directions. We show that the edge segments of any full component of such a tree contain a total of at most four directions if λ is not a multiple of 3, or six directions if λ is a multiple of 3. This result allows us to develop useful canonical forms for these full components. The structural properties of these Steiner minimum trees are then used to resolve an important open problem in the area: does there exist a polynomial time algorithm for constructing a Steiner minimum tree if the topology of the tree is known? We obtain a simple linear time algorithm for constructing a Steiner minimum tree for any given set of points and a given Steiner topology.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Brazil, M., Thomas, D., Weng, J. et al. Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. Algorithmica 44, 281–300 (2006). https://doi.org/10.1007/s00453-005-1178-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-005-1178-6