The packing problem, also known as cutting or nesting, has diverse applications in logistics,
manufacturing, layout design, and atlas generation. It involves arranging irregularly shaped …

This paper describes an optimization-based framework for finding arrangements of 2D
shapes subject to pairwise constraints. Such arrangements naturally arise in tasks such as …

The growing demands for computational power in cloud computing have led to a significant
increase in the deployment of high-performance servers. The growing power consumption of …

Using unprocessed materials in construction is a promising approach to reducing energy
and material consumption in the building industry. This paper presents a geometric planning …

Robotic bin packing is a challenging task, requiring compactly packing objects in a container
and also efficiently performing the computation, such that the robot arm need not wait too …

The 3D packing problem has a wide range of applications. However, the complex geometry
of irregular objects leads to a sharp increase in the number of placement combinations …

Designing the 3D layout of interconnected systems (SPI2), which is a ubiquitous task in
engineered systems, is of crucial importance. Intuitively, it can be thought of as the …

Simultaneous four‐axis machining involves a cutter that moves in all degrees of freedom
during carving. This strategy provides higher‐quality surface finishing compared to …

2D irregular packing is a classic combinatorial optimization problem with various
applications, such as material utilization and texture atlas generation. This NP-hard problem …

In polymer laser powder bed fusion (PBF-LB-P) techniques, such as laser sintering, the time
between scanning a given point in one layer and the same xy point in the next layer is …