On Continuity Properties for Infinite Rectangle Packing
نویسنده
چکیده
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems, and discuss how they might be used to obtain negative results for perfect rectangle packing problems.
منابع مشابه
VLSI module placement based on rectangle-packing by the sequence-pair
The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packing problem: Given set of rectangular modules of arbitrary sizes, place them without overlap on a plane within a rectangle of minimum area. Since the variety of the packing is uncountably infinite, the key issue for successful optimization is the introduction of a finite...
متن کاملOptimal Packing of High-Precision Rectangles
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our new benchmark includes rectangles of successively higher precision, challenging the previous state-of-the-art, which enumerates all locations for placing rectangles, as well as all bounding box widths and heights up to the optimal box. We inst...
متن کاملBottom-Left Placement Theorem for Rectangle Packing
This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectang...
متن کاملHardness in Perfect Rectangle Packing Problems
Rectangle Packing is considered a difficult NP-problem which has several application areas such as integrated circuit systems, and pallet packing. Generally, Rectangle Packing Problems consist of a set of rectangles for which a configuration must be found, the intention is to minimise the surface-area of the configurations bounding box. Existing research has predominantly investigated algorithm...
متن کاملSearch Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of real-world settings. For example, in electronic design automation, the packing of blocks into a circuit layout is essentially a rectangle packing problem. Rectangle packi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1705.02443 شماره
صفحات -
تاریخ انتشار 2017