A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES
From MaRDI portal
Publication:4880212
DOI10.1142/S021819599600006XzbMath0960.65558OpenAlexW2127782002MaRDI QIDQ4880212
Eyal Ben-Hanoch, Reuven Bar Yehuda
Publication date: 21 October 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021819599600006x
Nonnumerical algorithms (68W05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (3)
Fair and square: cake-cutting in two dimensions ⋮ Rectangle transformation problem ⋮ Lower bounds for approximate polygon decomposition and minimum gap
This page was built for publication: A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES