How To Pack Anything
Name
rong-vrong-meng-eecs-2023-thesis.pdf
Description
Thesis PDF
Size
46.13 MB
Format
Adobe PDF
Checksum (MD5)
0f1b88247df5da7c78f097eeb5e4b9bc
Author(s)
Rong, Victor
Advisor(s)
Durand, Frédo
Date Issued
June 2023
Publisher
Massachusetts Institute of Technology
Abstract
3D printers can make anything, from household tools to rocket engines, so long as the models can be packed into a given enclosure. The denser the packing, the more efficient the print is. Unfortunately, modern packing research has struggled with complex shapes and even proprietary packing software is not capable of effectively processing the wide variety of models created for 3D printing. A recent work (Spectral Packing [1]) uses the frequency space of a voxel grid to achieve impressive performance. However, voxel grids present their own challenges as their resolution and complexity are intrinsically linked. Our proposed extension alleviates these issues by allowing sub-voxel positioning, faster disassembly of loose objects, and incorporating a combinatorial search algorithm of tunable complexity. With these elements, we achieve improved results of packing arbitrary 3D objects.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright retained by author(s)
Persistent DSpace Link
