Steiner hull algorithm for the uniform orientation metrics

DOI10.1016/J.COMGEO.2007.10.002MaRDI QIDQ2479469zbMATH OpenOpenAlexFDO

Authors Christian Wulff-Nilsen

Publication date 26 March 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2007.10.002

zbMATH Keywords

minimum spanning treealgorithmcomputational geometrySteiner tree problemSteiner hulluniform orientation metric

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Steiner trees for fixed orientation metrics
• The Steiner tree problem in orientation metrics
• Optimal Steiner hull algorithm
• Rotational Steiner Ratio Problem Under Uniform Orientation Metrics
• Canonical forms and algorithms for Steiner trees in uniform orientation metrics
• A tight lower bound for Steiner orientation
• An algorithm for the steiner problem in the euclidean plane
• A tight lower bound for planar Steiner orientation
• Algorithms and Computation
• Flexibility of Steiner trees in uniform orientation metrics

Cites work

• scientific article; zbMATH DE number 750011 (Why is no real title available?)
• Canonical forms and algorithms for Steiner trees in uniform orientation metrics
• Minimum networks in uniform orientation metrics
• On finding the convex hull of a simple polygon
• Optimal Steiner hull algorithm
• The Steiner tree problem

Cited in

(3)

• Optimal Steiner hull algorithm
• scientific article; zbMATH DE number 2044913 (Why is no real title available?)
• Quasi-median hulls in Hamming space are Steiner hulls

This page was built for publication: Steiner hull algorithm for the uniform orientation metrics

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