Anchored rectangle and square packings
نویسندگان
چکیده
منابع مشابه
Anchored Rectangle and Square Packings
For points p1, . . . , pn in the unit square [0, 1] , an anchored rectangle packing consists of interior-disjoint axis-aligned empty rectangles r1, . . . , rn ⊆ [0, 1] such that point pi is a corner of the rectangle ri (that is, ri is anchored at pi) for i = 1, . . . , n. We show that for every set of n points in [0, 1], there is an anchored rectangle packing of area at least 7/12 − O(1/n), and...
متن کاملWirelength Optimal Rectangle Packings
Finding wirelength optimal packings of rectangles is a well known problem in VLSI design. We propose a branch and bound algorithm for this problem that is based on the rectangle packing algorithm of Moffitt and Pollack. It makes use of a very efficient implementation of an incremental network simplex algorithm. Our algorithm allows for the first time to find optimum solutions of three instances...
متن کاملThe Bichromatic Square and Rectangle Problems
We examine a variant of the maximum empty square (or rectangle) problem: Find an axis-aligned square (or rectangle) that contains as many blue points as possible without containing any red points. Let n be the total number of red and blue points. We solve the bichromatic square problem in O(n log n) time and O(n) space. We also solve the bichromatic rectangle problem in O(n log n) time and O(n ...
متن کاملRectangle and Square Representations of Planar Graphs
In the first part of this survey we consider planar graphs that can be represented by a dissections of a rectangle into rectangles. In rectangular drawings the corners of the rectangles represent the vertices. The graph obtained by taking the rectangles as vertices and contacts as edges is the rectangular dual. In visibility graphs and segment contact graphs the vertices correspond to horizonta...
متن کاملOptimal Rectangle Packing on Non-Square Benchmarks
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. We propose two new benchmarks, one where the orientation of the rectangles is fixed and one where it is free, that include rectangles of various aspect ratios. The new benchmarks avoid certain properties of easy instances, which we identify as ins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2017
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2017.08.003