Abstract
In this paper we consider Steiner minimum trees (SMT) in the plane, where the connections can only be along a given set of fixed but arbitrary (not necessarily uniform) orientations. The orientations define a metric, called the general orientation metric, A σ, where σ is the number of orientations. We prove that in A σ metric, there exists an SMT whose Steiner points belong to an (n−2)-level grid. This result generalizes a result by Lee and Shen [11], and a result by Du and Hwang [5]. In the former case, the same result was obtained for the special case when all orientations are uniform, while in the latter case the same result was proven for the special case when there are only three arbitrary orientations. We then modify the proof used in the main result for the special case when σ=3, i.e., only three arbitrary orientations are considered, and obtain a better result, which states that there exists an SMT whose Steiner points belong to an -level grid. The result has also been obtained by Lin and Xue [9] using a different approach.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received September 27, 1999; revised August 14, 2000
Rights and permissions
About this article
Cite this article
Li, Y., Leung, K. & Wong, C. Steiner Trees in General Nonuniform Orientations. Computing 66, 41–78 (2001). https://doi.org/10.1007/s006070170038
Issue Date:
DOI: https://doi.org/10.1007/s006070170038