Shapes In A Box – Disassembling 3D objects for efficient packing and fabrication

by   Marco Attene, et al.

Modern 3D printing technologies and the upcoming mass-customization paradigm call for efficient methods to produce and distribute arbitrarily-shaped 3D objects. This paper introduces an original algorithm to split a 3D model in parts that can be efficiently packed within a box, with the objective of reassembling them after delivery. The first step consists in the creation of a hierarchy of possible parts that can be tightly packed within their minimum bounding boxes. In a second step, the hierarchy is exploited to extract the (single) segmentation whose parts can be most tightly packed. The fact that shape packing is an NP-complete problem justifies the use of heuristics and approximated solutions whose efficacy and efficiency must be assessed. Extensive experimentation demonstrates that our algorithm produces satisfactory results for arbitrarily-shaped objects while being comparable to ad-hoc methods when specific shapes are considered.


page 2

page 7

page 8

page 9

page 10


Efficiently Disassemble-and-Pack for Mechanism

In this paper, we present a disassemble-and-pack approach for a mechanis...

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks

In this work, we present a new approach for competitive routing in wirel...

A Reallocation Algorithm for Online Split Packing of Circles

The Split Packing algorithm is an offline algorithm that packs a set of ...

A Constructive Heuristic Algorithm for 3D Bin Packing of Irregular Shaped Items

The three-dimensional bin packing problem (3D-BPP) plays an important ro...

A space-indexed formulation of packing boxes into a larger box

Current integer programming solvers fail to decide whether 12 unit cubes...

World-Model-Based Control for Industrial box-packing of Multiple Objects using NewtonianVAE

The process of industrial box-packing, which involves the accurate place...

COMPACT: Concurrent or Ordered Matrix-based Packing Arrangement Computation Technique

Packing optimization is a prevalent problem that necessitates robust and...

Please sign up or login with your details

Forgot password? Click here to reset