Piercing all translates of a set of axis-parallel rectangles
From MaRDI portal
Publication:6197805
DOI10.37236/12041WikidataQ128223378 ScholiaQ128223378MaRDI QIDQ6197805
Adrian Dumitrescu, Josef Tkadlec
Publication date: 19 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Approximation algorithms (68W25) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Piercing translates and homothets of a convex body
- Covering boxes by points
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane
- Optimal packing and covering in the plane are NP-complete
- On point covers of parallel rectangles
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Transversals for families of translates of a two-dimensional convex compact set
- On optimal piercing of a square
- A note on minimal dispersion of point sets in the unit cube
- On the dispersion of sparse grids
- An upper bound on the minimal dispersion
- A note on the dispersion of admissible lattices
- Piercing axis-parallel boxes
- On point covers of multiple intervals and axis-parallel rectangles
- Improved dispersion bounds for modified Fibonacci lattices
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- On the size of the largest empty box amidst a point set
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
- Transversal numbers of translates of a convex body
- Research Problems in Discrete Geometry
- How to find a battleship
- Polynomial-time approximation schemes for packing and piercing fat objects
- Empty Axis-Parallel Boxes
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
This page was built for publication: Piercing all translates of a set of axis-parallel rectangles
