A recursive algorithm for optimal guillotine-cutting of equal rectangles

MaRDI QIDQ5322638zbMATH OpenFDO

Authors Dongli He, Yaodong Cui, Daoyun Xu

Publication date 22 July 2009

zbMATH Keywords

dynamic programmingtwo-dimensional cuttingsheet metalrecursive approach

Mathematics Subject Classification ID

Dynamic programming (90C39) Computer science aspects of computer-aided design (68U07) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• Dynamic programming algorithms for the optimal cutting of equal rectangles
• A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
• An algorithm for the 2D guillotine cutting stock problem
• A fast algorithm for cutting a rectangle into equal rectangular pieces
• A recursive algorithm for constrained two-dimensional cutting problems

Cited in

(7)

• Recursive algorithm for the two‐dimensional cutting problem of punched strips
• Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Optimal cutting directions and rectangle orientation algorithm
• A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
• A fast algorithm for cutting a rectangle into equal rectangular pieces
• Simplest optimal guillotine cutting patterns for strips of identical circles

This page was built for publication: A recursive algorithm for optimal guillotine-cutting of equal rectangles

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