Learning based 2D Irregular Shape Packing

by   Zeshi Yang, et al.

2D irregular shape packing is a necessary step to arrange UV patches of a 3D model within a texture atlas for memory-efficient appearance rendering in computer graphics. Being a joint, combinatorial decision-making problem involving all patch positions and orientations, this problem has well-known NP-hard complexity. Prior solutions either assume a heuristic packing order or modify the upstream mesh cut and UV mapping to simplify the problem, which either limits the packing ratio or incurs robustness or generality issues. Instead, we introduce a learning-assisted 2D irregular shape packing method that achieves a high packing quality with minimal requirements from the input. Our method iteratively selects and groups subsets of UV patches into near-rectangular super patches, essentially reducing the problem to bin-packing, based on which a joint optimization is employed to further improve the packing ratio. In order to efficiently deal with large problem instances with hundreds of patches, we train deep neural policies to predict nearly rectangular patch subsets and determine their relative poses, leading to linear time scaling with the number of patches. We demonstrate the effectiveness of our method on three datasets for UV packing, where our method achieves a higher packing ratio over several widely used baselines with competitive computational speed.


page 9

page 10

page 11

page 14

page 15

page 16


A 4/3· OPT+2/3 approximation for big two-bar charts packing problem

Two-Bar Charts Packing Problem is to pack n two-bar charts (2-BCs) in a ...

(Re)packing Equal Disks into Rectangle

The problem of packing of equal disks (or circles) into a rectangle is a...

Online bin packing of squares and cubes

In the d-dimensional online bin packing problem, d-dimensional cubes of ...

Robust NFP generation for Nesting problems

Cutting and packing problems arise in a large variety of industrial appl...

Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes

We consider the irregular strip packing problem of rasterized shapes, wh...

One model Packs Thousands of Items with Recurrent Conditional Query Learning

Recent studies have revealed that neural combinatorial optimization (NCO...

Small Boxes Big Data: A Deep Learning Approach to Optimize Variable Sized Bin Packing

Bin Packing problems have been widely studied because of their broad app...

Please sign up or login with your details

Forgot password? Click here to reset