A fast 2D packing procedure for the interactive design and preparation of laser-cut objects for fabrication
Name
1193030886-MIT.pdf
Size
1.57 MB
Format
Adobe PDF
Checksum (MD5)
dc0378b8d0d43dad6597b596a40296bf
Author(s)
Sy, Adrian Reginald(Adrian Reginald C.)
Advisor(s)
Stefanie Mueller.
Alternative Title
Fast 2-dimension packing procedure for the interactive design and preparation of laser-cut objects for fabrication
Date Issued
2020
Publisher
Massachusetts Institute of Technology
Abstract
The 2D packing problem is commonly encountered in various CNC manufacturing workflows such as laser cutting. The goal of this optimization problem is to place a set of irregular polygons onto a material sheet without overlapping and in a way that minimizes wasted material. In this thesis, we delve into a fast 2D packing algorithm that automatically arranges parts of a user's design onto their available material sheets to provide live feedback on how much material they have left. To do this, we make use of the concept of the no fit polygon to generate candidate placements, and we utilize custom heuristics and performance optimization to improve packing quality and runtime . Our technical evaluation shows that the implementation is fast enough to work at interactive speeds and produce solutions of similar quality to other tools and algorithms that perform automated packing.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 57-60).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
