"Revolutionary Packing Hack Speeds Up and Simplifies the Process"
Originally Published 2 years ago — by MIT News
Researchers from MIT and Inkbit have developed a computational methodology called "dense, interlocking-free and Scalable Spectral Packing" (SSP) that makes the task of packing 3D objects more tractable. The SSP algorithm uses voxelization and mathematical techniques such as the fast Fourier transform (FFT) to efficiently determine the best placements for objects in a container, maximizing packing density and minimizing gaps. In one demonstration, the algorithm placed 670 objects in 40 seconds with a packing density of 36 percent. The approach has potential applications in various industries, including warehousing, shipping, and 3D printing, where it can increase efficiency and reduce costs.