On guillotine cutting sequences

DOI10.4230/LIPICS.APPROX-RANDOM.2015.1MaRDI QIDQ5351886zbMATH OpenFDO

Authors Fidaa Abed, Parinya Chalermsook, José R. Correa, Andreas Karrenbauer, P. Pérez-Lantero, José A. Soto, Andreas Wiese

Publication date 31 August 2017

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2015.1

zbMATH Keywords

guillotine cutsindependent setspackingrectanglessquares

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
• Guillotine cutting is asymptotically optimal for packing consecutive squares
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• scientific article; zbMATH DE number 2146649
• An algorithm for the 2D guillotine cutting stock problem

Cited in

(11)

• Guillotine cutting is asymptotically optimal for packing consecutive squares
• Approximation and online algorithms for multidimensional bin packing: a survey
• scientific article; zbMATH DE number 3980922 (Why is no real title available?)
• scientific article; zbMATH DE number 4065050 (Why is no real title available?)
• Tight approximation algorithms for geometric bin packing with skewed items
• On Guillotine Separability of Squares and Rectangles.
• Keep your distance: land division with separation
• Tight approximation algorithms for 2D guillotine strip packing
• Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
• On guillotine separable packings for the two-dimensional geometric knapsack problem
• An improved guillotine cut for squares

This page was built for publication: On guillotine cutting sequences

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