Optimal Steiner hull algorithm

DOI10.1016/S0925-7721(01)00065-7zbMath1089.68655OpenAlexW2031684137MaRDI QIDQ1862120

Pawel Winter

Publication date: 10 March 2003

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00065-7

zbMATH Keywords

algorithmsSteiner tree problemcomputational geometryDelaunay triangulationSteiner hull

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Solving the prize‐collecting Euclidean Steiner tree problem ⋮ Steiner hull algorithm for the uniform orientation metrics

Uses Software

• GeoSteiner

Cites Work

• Unnamed Item
• Unnamed Item
• The Steiner tree problem
• On finding the convex hull of a simple polygon
• On the Steiner Problem

This page was built for publication: Optimal Steiner hull algorithm