{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/151340"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/151340","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"How To Pack Anything","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Rong, Victor"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Durand, Frédo"],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023-06","date_published":"2023-06","updated_at":"2026-07-22T22:21:05Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"rights_urls":["https://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/151340","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Durand, Frédo"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Rong, Victor"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-07-31T19:32:33Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-07-31T19:32:33Z"]},{"key":"dc:date.issued","label":"Date","values":["2023-06"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/151340"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["How To Pack Anything"]}]}],"canonical_facts":{"dc:contributor.advisor":["Durand, Frédo"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Rong, Victor"],"dc:date.accessioned":["2023-07-31T19:32:33Z"],"dc:date.available":["2023-07-31T19:32:33Z"],"dc:date.issued":["2023-06"],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/151340"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"dc:rights.uri":["https://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["How To Pack Anything"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:21:05Z"}