Skip to main content
Log in

Expansion of Linear Steiner Trees

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received January 15, 1995; revised November 19, 1995, and February 3, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weng, J. Expansion of Linear Steiner Trees . Algorithmica 19, 318–330 (1997). https://doi.org/10.1007/PL00009176

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009176

Navigation