Li, Yuan YuanYuan YuanLiCheung S.K.Prof. LEUNG Kwong SakWong C.K.2023-03-302023-03-301998IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1998, vol. 45 (5), pp. 563 - 5741057-71301558-125Xhttp://hdl.handle.net/20.500.11861/7678We consider Steiner minimal trees (SMT's) in metrics defined by given orientations. The problem is motivated by wiring considerations of VLSI chips when the wiring direction is not restricted to only horizontal and vertical. In particular, we concentrate on the case when the given orientations form angles of 0°, 60°, and 120° (As-metric) since many interesting results can be obtained which may shed light on other metrics in the family. Specifically, we show that any SMT can be transformed to one with their Steiner points located on the grid points of a multilevel grid, where the number of levels can be quite small. Based on this result, we have developed a simulated annealing-based algorithm to generate near-optimal SMT's. Empirical results and comparisons with Euclidean cases are also given. © 1998 IEEE.enSteiner TreeLoss of GeneralityIntersection PointSubtreeFundamental ResultsMedian PointElementary PropertiesDemand PointsPeer Reviewed Journal Article10.1109/82.673638