Chips on wafers, or packing rectangles into grids

DOI10.1016/j.comgeo.2004.05.006zbMath1066.65024OpenAlexW2155559020MaRDI QIDQ705545

Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Publication date: 31 January 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.05.006

zbMATH Keywords

Computational geometryApproximation algorithmsPacking rectangles

Mathematics Subject Classification ID

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

Related Items (1)

Optimal wafer cutting in shuttle layout problems

Cites Work

• Recent advances on two-dimensional bin packing problems
• Finding minimum-cost flows by double scaling
• Tafel Musik: Formatting algorithm of tables
• A typology of cutting and packing problems
• Beyond the flow decomposition barrier
• Finding minimum-cost circulations by canceling negative cycles
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chips on wafers, or packing rectangles into grids