# (Re)packing Equal Disks into Rectangle

The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without overlapping.) We consider the following algorithmic generalization of the equal disk packing problem. In this problem, for a given packing of equal disks into a rectangle, the question is whether by changing positions of a small number of disks, we can allocate space for packing more disks. More formally, in the repacking problem, for a given set of n equal disks packed into a rectangle and integers k and h, we ask whether it is possible by changing positions of at most h disks to pack n+k disks. Thus the problem of packing equal disks is the special case of our problem with n=h=0. While the computational complexity of packing equal disks into a rectangle remains open, we prove that the repacking problem is NP-hard already for h=0. Our main algorithmic contribution is an algorithm that solves the repacking problem in time (h+k)^O(h+k)· |I|^O(1), where I is the input size. That is, the problem is fixed-parameter tractable parameterized by k and h.

• 59 publications
• 55 publications
• 19 publications
• 69 publications
• 42 publications
research
12/02/2022

### 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 ...
research
10/29/2018

### A study on load-balanced variants of the bin packing problem

We consider several extensions of the fractional bin packing problem, a ...
research
11/11/2021

### On the parameterized complexity of Compact Set Packing

The Set Packing problem is, given a collection of sets 𝒮 over a ground s...
research
09/19/2023

### Learning based 2D Irregular Shape Packing

2D irregular shape packing is a necessary step to arrange UV patches of ...
research
04/27/2021

### There is no APTAS for 2-dimensional vector bin packing: Revisited

We study vector bin packing and vector bin covering problems, multidimen...
research
03/02/2022

### On packing time-respecting arborescences

We present a slight generalization of the result of Kamiyama and Kawase ...
research
12/23/2022

### Circle packing in regular polygons

We study the packing of a large number of congruent and non–overlapping ...