Abstract
dc:description.abstract3D 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.
Degree
thesis:*- Name thesis:degree_name
- Master
- Department dc:contributor.department
- Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2023
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Rong, Victor
- Advisor dc:contributor.advisor
-
- Durand, Frédo
Rights
dc:rights- Statement dc:rights
-
- In Copyright - Educational Use Permitted
- Copyright retained by author(s)
- Licence dc:rights.uri
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/1721.1/151340
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/151340