Efficient nesting of congruent convex figures

Research output: Contribution to journalArticlepeer-review


Optimal nesting is the arrangement of twodimensional polygons within a rectangular board so that waste is minimized. Our approach follows a top-down, stepwise refinement of the original problem into simpler subproblems; the combined solution of all of the problems permits the solution of the original problem. We first show that the original problem can be decomposed into two subproblems--one consisting of finding all convex paver polygons and the other of optimal (minimal waste) circumscription of the original figure in the most appropriate paver polygon.

Original languageEnglish
Pages (from-to)228-235
Number of pages8
JournalCommunications of the ACM
Issue number3
StatePublished - 1 Mar 1984


  • optimal nesting

Cite this