DeepAI AI Chat
Log In Sign Up

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

by   Shunji Umetani, et al.

We consider the irregular strip packing problem of rasterized shapes, where a given set of pieces of irregular shapes represented in pixels should be placed into a rectangular container without overlap. The rasterized shapes enable us to check overlap without any exceptional handling due to geometric issues, while they often require much memory and computational effort in high-resolution. We develop an efficient algorithm to check overlap using a pair of scanlines that reduces the complexity of rasterized shapes by merging consecutive pixels in each row and column into strips with unit width, respectively. Based on this, we develop coordinate descent heuristics that repeat a line search in the horizontal and vertical directions alternately. Computational results for test instances show that the proposed algorithm obtains sufficiently dense layouts of rasterized shapes in high-resolution within a reasonable computation time.


page 2

page 5

page 6

page 7

page 10

page 11

page 13

page 21


Basic Analysis of Bin-Packing Heuristics

The bin-packing problem continues to remain relevant in numerous applica...

Robust NFP generation for Nesting problems

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

Symmetry-constrained Rectification Network for Scene Text Recognition

Reading text in the wild is a very challenging task due to the diversity...

Learning based 2D Irregular Shape Packing

2D irregular shape packing is a necessary step to arrange UV patches of ...

Dual-Flattening Transformers through Decomposed Row and Column Queries for Semantic Segmentation

It is critical to obtain high resolution features with long range depend...

Learning Physically Realizable Skills for Online Packing of General 3D Shapes

We study the problem of learning online packing skills for irregular 3D ...

Optimal Rectangle Packing: An Absolute Placement Approach

We consider the problem of finding all enclosing rectangles of minimum a...