A fast algorithm for cutting a rectangle into equal rectangular pieces

MaRDI QIDQ5933025zbMATH OpenFDO

Authors M. Z. Arslanov

Publication date 5 July 2001

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

cutting a rectanglemethod of continued fractionspolynomial-time algorithmsubdivision

Mathematics Subject Classification ID

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

Recommendations

• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
• A recursive algorithm for optimal guillotine-cutting of equal rectangles
• Simplest optimal cutting patterns for equal rectangles
• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds

Cited in

(8)

• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• On optimal cuts of hyperrectangles
• Rectangle transformation problem
• An optimal algorithm for a parallel cutting problem.
• scientific article; zbMATH DE number 3867069 (Why is no real title available?)
• A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
• A fast algorithm for detecting admissible cuts in prestressed hollow core units
• A recursive algorithm for optimal guillotine-cutting of equal rectangles

This page was built for publication: A fast algorithm for cutting a rectangle into equal rectangular pieces

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