An exact algorithm for constructing minimum Euclidean skeletons of polygons

DOI10.1007/s10898-021-01101-3zbMath1489.90006OpenAlexW3208562243MaRDI QIDQ2131144

Marcus Brazil, Nicolau Andrés-Thió, Doreen Anne Thomas, Marcus Volz, Charl J. Ras

Publication date: 25 April 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01101-3

zbMATH Keywords

polygonsskeletonsobstacle avoidancebeam detectorsopaque covers

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10)

Uses Software

• CPLEX

Cites Work

• Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Generating random polygons with given vertices
• A near linear time approximation scheme for Steiner tree among obstacles in the plane
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• Steiner's problem in graphs and its implications

This page was built for publication: An exact algorithm for constructing minimum Euclidean skeletons of polygons