Online Packing to Minimize Area or Perimeter

We consider online packing problems where we get a stream of axis-parallel rectangles. The rectangles have to be placed in the plane without overlapping, and each rectangle must be placed without knowing the subsequent rectangles. The goal is to minimize the perimeter or the area of the axis-parallel bounding box of the rectangles. We either allow rotations by 90◦ or translations only. For the perimeter version we give algorithms with an absolute competitive ratio slightly less than 4 when only translations are allowed and when rotations are also allowed. We then turn our attention to minimizing the area and show that the asymptotic competitive ratio of any algorithm is at least Ω( √ n), where n is the number of rectangles in the stream, and this holds with and without rotations. We then present algorithms that match this bound in both cases and the competitive ratio is thus optimal to within a constant factor. We also show that the competitive ratio cannot be bounded as a function of Opt. We then consider two special cases. The first is when all the given rectangles have aspect ratios bounded by some constant. The particular variant where all the rectangles are squares and we want to minimize the area of the bounding square has been studied before and an algorithm with a competitive ratio of 8 has been given [Fekete and Hoffmann, Algorithmica, 2017]. We improve the analysis of the algorithm and show that the ratio is at most 6, which is tight. The second special case is when all edges have length at least 1. Here, the Ω( √ n) lower bound still holds, and we turn our attention to lower bounds depending on Opt. We show that any algorithm for the translational case has an asymptotic competitive ratio of at least Ω( √ Opt). If rotations are allowed, we show a lower bound of Ω( 4 √ Opt). For both versions, we give algorithms that match the respective lower bounds: With translations only, this is just the algorithm from the general case with competitive ratio O( √ n) = O( √ Opt). If rotations are allowed, we give an algorithm with competitive ratio O(min{ √ n, 4 √ Opt}), thus matching both lower bounds simultaneously.

[1]  Paul Erdös,et al.  On Packing Squares with Equal Squares , 1975, J. Comb. Theory, Ser. A.

[2]  Brenda S. Baker,et al.  Shelf Algorithms for Two-Dimensional Packing Problems , 1983, SIAM J. Comput..

[3]  Helmut Alt,et al.  Packing Convex Polygons into Rectangular Boxes , 2000, JCDCG.

[4]  Mark de Berg,et al.  Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons , 2020, J. Comput. Geom..

[5]  J. Januszewski,et al.  On-Line Packing Sequences of Cubes in the Unit Cube , 1997 .

[6]  Gerhard J. Woeginger,et al.  Competitive Analysis of Algorithms , 1996, Online Algorithms.

[7]  Rob van Stee,et al.  SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions , 2015, SIGA.

[8]  Victor J. Milenkovic,et al.  Rotational polygon containment and minimum enclosure using only robust 2D constructions , 1999, Comput. Geom..

[9]  Sándor P. Fekete,et al.  Online Square-into-Square Packing , 2014, Algorithmica.

[10]  Fan Chung Graham,et al.  Efficient Packings of Unit Squares in a Large Square , 2020, Discret. Comput. Geom..

[11]  Eckehard Specht,et al.  High density packings of equal circles in rectangles with variable aspect ratio , 2013, Comput. Oper. Res..

[12]  Otfried Cheong,et al.  Aligning Two Convex Figures to Minimize Area or Perimeter , 2010, Algorithmica.

[13]  Boris D. Lubachevsky,et al.  Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio , 2003 .

[14]  Brian Brubach,et al.  Improved Bound for Online Square-into-Square Packing , 2014, WAOA.

[15]  Helmut Alt,et al.  Computational Aspects of Packing Problems , 2016, Bull. EATCS.

[16]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[17]  Otfried Cheong,et al.  Packing 2D Disks into a 3D Container , 2018, WALCOM.

[18]  Sang Won Bae,et al.  Bundling Three Convex Polygons to Minimize Area or Perimeter , 2013, WADS.

[19]  Gerhard J. Woeginger,et al.  On-line Packing and Covering Problems , 1996, Online Algorithms.

[20]  Marek Lassak.  On-Line Potato-Sack Algorithm Efficient for Packing Into Small Boxes , 1997 .

[21]  Tony C. Woo,et al.  Determining in Linear Time the Minimum Area Convex Hull of Two Polygons , 1988 .

[22]  Henrik I. Christensen,et al.  Approximation and online algorithms for multidimensional bin packing: A survey , 2017, Comput. Sci. Rev..

[23]  Ronald L. Graham,et al.  Minimum perimeter rectangles that enclose congruent non-overlapping circles , 2009, Discret. Math..

[24]  Rob van Stee,et al.  SIGACT news online algorithms column 20: the power of harmony , 2012, SIGA.

[25]  Victor J. Milenkovic,et al.  Translational polygon containment and minimal enclosure using linear programming based restriction , 1996, STOC '96.