Expansion of Linear Steiner Trees |
| |
Authors: | J. F. Weng |
| |
Affiliation: | (1) Department of Mathematics, The University of Melbourne, VIC 3052, Australia. weng@maths.mu.oz.au., AU |
| |
Abstract: | A Steiner tree T on a given set of points A is called linear if all Steiner points, including those collapsing into their adjacent given points, lie on one path referred
to as its trunk. Suppose A is a simple polygonal line. Roughly speaking, T is similar to A if its trunk turns right or left when A does. In this paper we prove that A can be expanded to another polygonal line, and T can be constructed in linear time using this expansion method.
Received January 15, 1995; revised November 19, 1995, and February 3, 1996. |
| |
Keywords: | . Steiner tree Linear-time algorithm. |
本文献已被 SpringerLink 等数据库收录! |
|