Steiner Minimal Trees in Simple Polygons

  • Authors:

  • Pawel Winter

  • Affiliations:

  • -

  • Venue:
  • Steiner Minimal Trees in Simple Polygons
  • Year:
  • 1995

  • Short trees in polygons

    Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization

Quantified Score

Hi-index 0.00

Visualization

Abstract

An O(n log n) time and O(n) space algorithm for the Euclidean Steiner tree problem with four terminals in a simple polygon with n vertices is given. Its applicability to the problem of determining good quality solutions for any number of terminals is discussed.