Anchored rectangle and square packings
From MaRDI portal
Publication:1751252
DOI10.1016/j.disopt.2017.08.003zbMath1387.52030OpenAlexW2963124996MaRDI QIDQ1751252
Adrian Dumitrescu, Csaba D. Tóth, Kevin Balas
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5905/
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25)
Related Items (3)
Maximum Area Axis-Aligned Square Packings. ⋮ On the complexity of anchored rectangle packing ⋮ The reach of axis-aligned squares in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing anchored rectangles
- On the number of anchored rectangle packings for a planar point set
- Approximation algorithms for maximum independent set of pseudo-disks
- On covering problems of Rado
- Labeling points with given rectangles
- Label placement by maximum independent set in rectangles
- Point labeling with sliding labels
- On the largest empty axis-parallel box amidst \(n\) points
- A combinatorial theorem on labeling squares with points and its application
- A constant-factor approximation for multi-covering with disks
- MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS
- Computing the Largest Empty Rectangle
- Elastic labels around the perimeter of a map
- Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
- MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
- Polynomial-time approximation schemes for packing and piercing fat objects
- LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
- Algorithms – ESA 2005
- On Steiner’s Problem with Rectilinear Distance
- Some Covering Theorems (III)
- Some Covering Theorems (I)
- Some Covering Theorems (II)
This page was built for publication: Anchored rectangle and square packings
