Optimal Steiner hull algorithm

DOI10.1016/S0925-7721(01)00065-7MaRDI QIDQ1862120zbMATH OpenOpenAlexFDO

Authors 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

algorithmscomputational geometryDelaunay triangulationSteiner tree problemSteiner hull

Mathematics Subject Classification ID

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

Recommendations

• Steiner hull algorithm for the uniform orientation metrics
• Steiner minimal trees for three points with one convex polygonal obstacle
• Two new criteria for finding Steiner hulls in Steiner tree problems
• The role of Steiner hulls in the solution to Steiner tree problems
• Exact computation of Steiner minimal trees in the plane

Cites work

• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• On finding the convex hull of a simple polygon
• On the Steiner Problem
• The Steiner tree problem

Cited in

(3)

• Solving the prize‐collecting Euclidean Steiner tree problem
• Steiner hull algorithm for the uniform orientation metrics
• Quasi-median hulls in Hamming space are Steiner hulls

Describes a project that uses

Uses Software

• GeoSteiner

This page was built for publication: Optimal Steiner hull algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862120)