Stabbing boxes with finitely many axis-parallel lines and flats
From MaRDI portal
Publication:6646396
DOI10.1016/J.DISC.2024.114269MaRDI QIDQ6646396FDOQ6646396
Authors: Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Helly-type theorems and geometric transversal theory (52A35) Graph theory (05Cxx) Computing methodologies and applications (68Uxx)
Cites Work
- A generalization of Caratheodory's theorem
- A Helly-type theorem for line transversals to disjoint unit balls
- Helly-type theorems for line transversals to disjoint unit balls
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering boxes by points
- Piercing \(d\)-intervals
- A non-linear lower bound for planar epsilon-nets
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Transversal numbers for hypergraphs arising in geometry
- Helly’s theorem: New variations and applications
- Über eine Variante zum Hellyschen Satz
- Covering and coloring problems for relatives of intervals
- Fast stabbing of boxes in high dimensions
- Piercing quasi-rectangles-on a problem of Danzer and Rogers
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Coloring axis-parallel rectangles
- A Helly-type theorem for higher-dimensional transversals
- Maintenance of a piercing set for intervals with applications
- Intersection properties of boxes in \(R^ n\).
- Hadwiger's Transversal Theorem In Higher Dimensions
- New Lower Bounds for ϵ-nets
- Tight lower bounds for the size of epsilon-nets
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- Binary Space Partitions for Axis-Aligned Fat Rectangles
- Bounding the piercing number
- Über einen Satz Hellyscher Art
- Smallest \(k\)-enclosing rectangle revisited
- Cuttings for disks and axis-aligned rectangles in three-space
- The discrepancy of boxes in higher dimension
- Über Mengen konvexer Körper mit gemeinschaftlichen Punkten.
- A simple proof of optimal epsilon nets
- Piercing axis-parallel boxes
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- On Wegner's inequality for axis-parallel rectangles
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem
- Helly-type problems
- A Helly-type theorem for hyperplane transversals to well-separated convex sets
- Coloring and Maximum Weight Independent Set of Rectangles
- Lower bounds for piercing and coloring boxes
- An $(\aleph_0,k+2)$-Theorem for $k$-Transversals
- A 3-approximation algorithm for maximum independent set of rectangles
This page was built for publication: Stabbing boxes with finitely many axis-parallel lines and flats
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646396)